Abstract
The basic problem of combinatorial mathematics is that of recognizing and enumerating or at least counting objects of specified character, out of an enormous number of unspecified objects. Most often, this is accomplished, implicitly or explicitly, by attaching an algebraic tag or weight to each desired trait and summing the weights thereby obtained. The desired objects can then be identified at leisure.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1971 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Percus, J.K. (1971). Counting and Enumeration on a Set. In: Combinatorial Methods. Applied Mathematical Sciences, vol 4. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-6404-0_1
Download citation
DOI: https://doi.org/10.1007/978-1-4612-6404-0_1
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-90027-8
Online ISBN: 978-1-4612-6404-0
eBook Packages: Springer Book Archive