# Combinatorics

• Randolph Nelson
Chapter

## 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.

## Keywords

Generate Function Power Series Service Center Power Series Expansion Replacement Policy
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## Bibliographic Notes

1. [18]
D. I. A. Cohen. Basic Techniques of Combinatorial Theory. John Wiley and Sons, 1978.Google Scholar
2. [20]
G. M. Constantine. Combinatorial Theory and Statistical Design. John Wiley and Sons, 1987.Google Scholar
3. [43]
R.L. Graham, D.E. Knuth, and O. Patashnik. Concrete Mathematics. Addison-Wesley, 1989.Google Scholar
4. [96]
J. Riordan. An Introduction to Combinatorial Analysis. Princeton University Press, 1978.Google Scholar
5. [119]
6. D.I.A. Cohen. Basic Techniques of Combinatorial Theory. John Wiley and Sons, 1978.Google Scholar
7. G.M. Constantine. Combinatorial Theory and Statistical Design. John Wiley and Sons, 1987.Google Scholar
8. R.L. Graham, D.E. Knuth, and O. Patashnik. Concrete Mathematics. Addison-Wesley, 1989.Google Scholar
9. J. Riordan. An Introduction to Combinatorial Analysis. Princeton University Press, 1978.Google Scholar