# Difference between revisions of "Combination"

(TeX) |
m (better) |
||

(3 intermediate revisions by the same user not shown) | |||

Line 1: | Line 1: | ||

{{TEX|done}} | {{TEX|done}} | ||

+ | |||

+ | {{MSC|05A}} | ||

+ | |||

''of $n$ elements from $m$'' | ''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 mn$ and is equal to | 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 mn$ and is equal to | ||

− | $$\frac{m!}{n!(m-n)!}.$$ | + | $$\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 | The generating function for the sequence $C_m^n$, $n=0,\dots,m$, $C_m^0=1$, has the form | ||

Line 10: | Line 13: | ||

$$\sum_{n=0}^m\binom mnx^n=(1+x)^m.$$ | $$\sum_{n=0}^m\binom mnx^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|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 | + | 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|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}^kx^k=\sum_{k=0}^\infty\binom{m+k-1}{k}x^k=\frac{1}{(1-x)^m}.$$ | $$\sum_{k=0}^\infty C_{m+k-1}^kx^k=\sum_{k=0}^\infty\binom{m+k-1}{k}x^k=\frac{1}{(1-x)^m}.$$ | ||

====References==== | ====References==== | ||

− | <table><TR><TD valign="top">[1]</TD> <TD valign="top"> V.N. Sachkov, "Combinatorial methods in discrete mathematics" , Moscow (1977) (In Russian)</TD></TR><TR><TD valign="top">[2]</TD> <TD valign="top"> J. Riordan, "An introduction to combinatorial analysis" , Wiley (1958)</TD></TR></table> | + | <table> |

+ | <TR><TD valign="top">[1]</TD> <TD valign="top"> V.N. Sachkov, "Combinatorial methods in discrete mathematics" , Moscow (1977) (In Russian)</TD></TR> | ||

+ | <TR><TD valign="top">[2]</TD> <TD valign="top"> J. Riordan, "An introduction to combinatorial analysis" , Wiley (1958)</TD></TR> | ||

+ | </table> | ||

====Comments==== | ====Comments==== | ||

+ | The numbers of combinations, $\binom mn$, 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,\ldots,x_n$. A combination with repetition of $k$ elements from $X$ may be encoded as a sequence of symbols consisting of $k$ dots $\bullet$ and $n-1$ bars $|$, where the number of occurrences of $\bullet$ 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 ${\bullet}{\bullet}||{\bullet}|\cdots$ 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==== | ====References==== | ||

− | <table><TR><TD valign="top">[a1]</TD> <TD valign="top"> M. Hall, "Combinatorial theory" , Wiley (1986)</TD></TR></table> | + | <table> |

+ | <TR><TD valign="top">[a1]</TD> <TD valign="top"> M. Hall, "Combinatorial theory" , Wiley (1986) {{ZBL|0907.05002}}</TD></TR> | ||

+ | </table> |

## Latest revision as of 17:22, 18 September 2016

2010 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 mn$ 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 mnx^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}^kx^k=\sum_{k=0}^\infty\binom{m+k-1}{k}x^k=\frac{1}{(1-x)^m}.$$

#### References

[1] | V.N. Sachkov, "Combinatorial methods in discrete mathematics" , Moscow (1977) (In Russian) |

[2] | J. Riordan, "An introduction to combinatorial analysis" , Wiley (1958) |

#### Comments

The numbers of combinations, $\binom mn$, 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,\ldots,x_n$. A combination with repetition of $k$ elements from $X$ may be encoded as a sequence of symbols consisting of $k$ dots $\bullet$ and $n-1$ bars $|$, where the number of occurrences of $\bullet$ 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 ${\bullet}{\bullet}||{\bullet}|\cdots$ 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

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

**How to Cite This Entry:**

Combination.

*Encyclopedia of Mathematics.*URL: http://encyclopediaofmath.org/index.php?title=Combination&oldid=33252