Combination

2020 Mathematics Subject Classification: Primary: 05A [MSN][ZBL]

of $n$ elements from $m$

A subset of cardinality $n$ of some given finite set of cardinality $m$ . The number of combinations of $n$ elements from $m$ is written $C_{m}^{n}$ or $(\binom{m}{n})$ and is equal to

$\frac{m!}{n! (m - n)!} .$

The generating function for the sequence $C_{m}^{n}$ , $n = 0, \dots, m$ , $C_{m}^{0} = 1$ , has the form

$\sum_{n = 0}^{m} (\binom{m}{n}) x^{n} = (1 + x)^{m} .$

Combinations can also be considered as non-ordered samples of size $n$ from a general aggregate of $m$ elements. In combinatorial analysis, a combination is an equivalence class of arrangements of $n$ elements from $m$ (cf. Arrangement), where two arrangements of size $n$ from a given $m$ -element set are called equivalent if they consist of the same elements taken the same number of times. In the case of arrangements without repetitions, every equivalence class is determined by the set of elements of an arbitrary arrangement from this class, and can thus be considered as a combination.

In the case of arrangements with repetitions, one arrives at a generalization of the concept of a combination, and then an equivalence class is called a combination with repetitions. The number of combinations with repetitions of $n$ from $m$ is equal to $C_{m + n - 1}^{n}$ , and the generating function for these numbers has the form

$\sum_{k = 0}^{\infty} C_{m + k - 1}^{k} x^{k} = \sum_{k = 0}^{\infty} (\binom{m + k - 1}{k}) x^{k} = \frac{1}{(1 - x)^{m}} .$

References[edit]

[1]	V.N. Sachkov, "Combinatorial methods in discrete mathematics" , Moscow (1977) (In Russian)
[2]	J. Riordan, "An introduction to combinatorial analysis" , Wiley (1958)

Comments[edit]

The numbers of combinations, $(\binom{m}{n})$ , are just the binomial coefficients.

The formula for the number of combinations with repetition may be derived as follows. Given a set $X$ of size $n$ , list the elements in arbitrary order $x_{1}, \dots, x_{n}$ . A combination with repetition of $k$ elements from $X$ may be encoded as a sequence of symbols consisting of $k$ dots $∙$ and $n - 1$ bars $|$ , where the number of occurrences of $∙$ between the $i - 1$ -th $|$ and the $i$ -th $|$ denotes the number of occurrences of $x_{i}$ in the combination. Thus, for example, the sequence beginning $∙ ∙ | | ∙ | \dots$ encodes a combination containing $2$ occurrences of $x_{1}$ , $0$ occurrences of $x_{2}$ and $1$ occurrence of $x_{3}$ . The number of such encoding sequences is then $(\binom{n + k - 1}{k})$ .

References[edit]

[a1]	M. Hall, "Combinatorial theory" , Wiley (1986) Zbl 0907.05002