Abstract
Probabilistic arguments can often be reduced to techniques where one enumerates all possibilities. These techniques are based on the Law of Total Probability and are most useful when there is a set of equally probable basic events and when events of interest consist of combinations of these basic events. In this chapter we focus on such enumerative techniques and derive formal counting techniques collectively called combinatorics. We define four different counting paradigms in Section 3.2,which are expressed in terms of selecting distinguishable balls from an urn or, equivalently, in terms of allocating indistinguishable balls to different urns. To derive expressions for the number of different possibilities for each counting paradigm, we establish recurrence relationships between the number of possibilities in the initial problem to that of a similar, but smaller, problem. This type of argument corresponds to partitioning the counting space into disjoint sets, which are smaller and easier to count.
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.
Bibliographic Notes
D. I. A. Cohen. Basic Techniques of Combinatorial Theory. John Wiley and Sons, 1978.
G. M. Constantine. Combinatorial Theory and Statistical Design. John Wiley and Sons, 1987.
R.L. Graham, D.E. Knuth, and O. Patashnik. Concrete Mathematics. Addison-Wesley, 1989.
J. Riordan. An Introduction to Combinatorial Analysis. Princeton University Press, 1978.
N. Y. Vilenkin. Combinatorics. Academic Press, 1971.
D.I.A. Cohen. Basic Techniques of Combinatorial Theory. John Wiley and Sons, 1978.
G.M. Constantine. Combinatorial Theory and Statistical Design. John Wiley and Sons, 1987.
R.L. Graham, D.E. Knuth, and O. Patashnik. Concrete Mathematics. Addison-Wesley, 1989.
J. Riordan. An Introduction to Combinatorial Analysis. Princeton University Press, 1978.
N.Y. Vilenkin. Combinatorics. Academic Press, 1971.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media New York
About this chapter
Cite this chapter
Nelson, R. (1995). Combinatorics. In: Probability, Stochastic Processes, and Queueing Theory. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-2426-4_3
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2426-4_3
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-2846-7
Online ISBN: 978-1-4757-2426-4
eBook Packages: Springer Book Archive