Discover

'Combinatorics' is a branch of pure mathematics concerning the study of discrete (and usually finite) objects. It is related to many other areas of mathematics, such as algebra, probability theory, ergodic theory and geometry, as well as to applied subjects such as computer science and statistical physics. Aspects of combinatorics include "counting" the objects satisfying certain criteria (''enumerative combinatorics''), deciding when the criteria can be met, and constructing and analyzing objects meeting the criteria (as in ''combinatorial designs and matroid theory''), finding "largest", "smallest", or "optimal" objects (''extremal combinatorics'' and ''combinatorial optimization''), and finding algebraic structures these objects may have (''algebraic combinatorics'').
Combinatorics is as much about problem solving as theory building, though it has developed powerful theoretical methods, especially since the later twentieth century (see the page List of combinatorics topics for details of the more recent development of the subject). One of the oldest and most accessible parts of combinatorics is graph theory, which also has numerous natural connections to other areas.
A trivial example of a combinatorial question is the following: What is the number of possible orderings of a deck of 52 distinct playing cards? The answer is 52! (fifty-two factorial), which is equal to about 8.0658 × 10⁶⁷.
Another example of a more difficult problem: Given a certain number ''n'' of people, is it possible to assign them to sets so that each person is in at least one set, each pair of people is in exactly one set together, every two sets have exactly one person in common, and no set contains everyone, all but one person, or exactly one person? The answer depends on ''n''. See "Design theory" below.
A mathematician who studies combinatorics is often referred to as a ''combinatorialist'' or ''combinatorist''.

Contents

Permutations

Permutation with repetition

Permutation without repetition

Combinations

Combination without repetition

Combination with repetition

Enumerative combinatorics

Set sizes motivate a naming convention

Structural combinatorics

Design theory

Ramsey theory

Matroid theory

Extremal combinatorics

See also

References

Permutations

Main articles: Permutations

Permutation with repetition

When order matters, and an object can be chosen more than once, the number of permutations is
:$n^r\; ,!$
where ''n'' is the number of objects from which you can choose and ''r'' is the number to be chosen.
For example, if you have the letters A, B, C, and D and you wish to discover the number of ways to arrange them in three letter patterns (trigrams)
# order matters (e.g., A-B is different from B-A, both are included as possibilities)
# an object can be chosen more than once (A-A possible)
you find that there are 4³ or 64 ways. This is because for the first slot you can choose any of the four values, for the second slot you can choose any of the four, and for the final slot you can choose any of the four letters. Multiplying them together gives the total.

Permutation without repetition

When the order matters and each object can be chosen only once, then the number of permutations is
: where ''n'' is the number of objects from which you can choose, ''r'' is the number to be chosen and "!" is the standard symbol meaning factorial.
For example, if you have five people and are going to choose three out of these, you will have 5!/(5−3)! = 60 permutations.
Note that if ''n'' = ''r'' (meaning the number of chosen elements is equal to the number of elements to choose from; five people and pick all five) then the formula becomes
:
where 0! = 1.
For example, if you have the same five people and you want to find out how many ways you may arrange them, it would be 5! or 5 × 4 × 3 × 2 × 1 = 120 ways. The reason for this is because you can choose from 5 for the initial slot, then you are left with only 4 to choose from for the second slot etc. Multiplying them together gives the total of 120.
An alternative notation is ''nPr'' where ''n'' stands for the total number of objects, and the ''r'' stands for the number of objects that will be chosen. For example, if you have 10 shapes in a bag and you will pick 4 of them out, the notation would be: ''10 P 4''. This notation is often used on calculators.

Combinations

Main articles: Combinations

Combination without repetition

When the order does not matter and each object can be chosen only once, the number of combinations is the binomial coefficient
:$\{nchoose\; r\}\; =\; \{\{n!\}\; over\; \{r!(n\; -\; r)!\}\}$
where ''n'' is the number of objects from which you can choose and ''r'' is the number to be chosen.
For example, if you have ten numbers and wish to choose 5 you would have 10!/(5!(10−5)!) = 252 ways to choose.
Just as with permutations, there is an alternate notation used primarily on calculators, of the form ''nCr''.

Combination with repetition

Main articles: Multiset#Multiset coefficients

When the order does not matter and an object can be chosen more than once, then the number of combinations is
:$\{\{(n\; +\; r\; -\; 1)!\}\; over\; \{r!(n\; -\; 1)!\}\}\; =\; \{\{n\; +\; r\; -\; 1\}\; choose\; \{r\}\}\; =\; \{\{n\; +\; r\; -\; 1\}\; choose\; \{n\; -\; 1\}\}$
where ''n'' is the number of objects from which you can choose and ''r'' is the number to be chosen.
For example, if you have ten types of donuts (''n'') on a menu to choose from and you want three donuts (''r'') there are (10 + 3 − 1)! / 3!(10 − 1)! = 220 ways to choose (see also multiset).

Enumerative combinatorics

Counting the number of ways that certain patterns can be formed is the central problem of enumerative combinatorics.
Two examples of this type of problem are counting combinations and counting permutations (as discussed in the previous section).
More generally, given an infinite collection of finite sets {''S''_''i''} indexed by the natural numbers, enumerative combinatorics seeks to describe a ''counting function'' which counts the number of objects in ''S''_''n'' for each ''n''. Although counting the number of elements in a set is a rather broad mathematical problem, many of the problems that arise in applications have a relatively simple combinatorial description.
The simplest such functions are ''closed formulas'', which can be expressed as a composition of elementary functions such as factorials, powers, and so on. For instance, as noted above, the number of different possible orderings of a deck of ''n'' cards is ''f''(''n'') = ''n''!. Often, no closed form is initially available. In these cases, we frequently first derive a recurrence relation, then solve the recurrence to arrive at the desired closed form. We demonstrate this method below.
For example, let ''f''(''n'') be the number of distinct subsets of the set $S(n)=\{1,2,3,\; ldots\; ,n\; \}$ that do not contain two consecutive integers. When ''n'' = 4, we have the sets {}, {1}, {2}, {3}, {4}, {1,3}, {1,4}, {2,4}, so ''f''(4) = 8. We count the desired subsets of $S(n)$ by separately counting those subsets that contain element $n$ and those that do not. If a subset contains $n$, then it does not contain element $n-1$. So there are exactly $f(n-2)$ of the desired subsets that contain element $n$. The number of subsets that do not contain $n$ is simply $f(n-1)$. Adding these numbers together, we get the recurrence relation:
:$f(n)\; =\; f(n-1)\; +\; f(n-2),\; ,$
where $f(1)=2$ and $f(2)=3$.
As early as 1202, Leonardo Fibonacci studied these numbers. They are now called Fibonacci numbers; in particular, $f(n)$ is known as the $n+2$nd Fibonacci number. Although the recurrence relation allows us to compute every Fibonacci number, the computation is inefficient. However, by using standard techniques to solve recurrence relations, we can reach the closed form solution:
:
where $phi\; =\; (1\; +\; sqrt\; 5)\; /\; 2$, the golden ratio.
Often, a complicated closed formula yields little insight into the behavior of the counting function as the number of counted objects grows.
In these cases, a simple asymptotic approximation may be preferable. A function $g(n)$ is an asymptotic approximation to $f(n)$ if $f(n)/g(n)$
ightarrow 1 as $n$
ightarrowinfinity. In this case, we write $f(n)\; sim\; g(n),$.
In the above example, an asymptotic approximation to $f(n)$ is:
:
as ''n'' becomes large.
Finally, ''f''(''n'') may be expressed by a formal power series, called its ''generating function'', which is most commonly either the ordinary generating function
:$sum\_\{nge\; 0\}\; f(n)\; x^n$
or the exponential generating function
:
Once determined, the generating function may allow one to extract all the information given by the previous approaches. In addition, the various natural operations on generating functions such as addition, multiplication, differentiation, etc., have a combinatorial significance; this allows one to extend results from one combinatorial problem in order to solve others.
Enumerative combinatorics is used frequently in computer science, because counting a set can closely correspond to computing the elements of a set.

Set sizes motivate a naming convention

Various straightforward results from enumerative combinatorics motivate the notations for corresponding types of set theoretical constructions. This very useful convention exploits the natural (semantic and notational) connections between a set ''S'' and its cardinality |''S''|. It likely originates by analogy from the symbol ''A'' × ''B'' for the Cartesian product of sets ''A'' and ''B'' and the fact that |''A'' × ''B''| is precisely the (arithmetic) product |''A''| · |''B''|. Other examples of this ''size-of'' notation include ''X'' + ''Y'' for the disjoint union of sets ''X'' and ''Y'', ''Y''^''X'' for the set of all functions from ''X'' to ''Y'', the special case 2^''S'' for the power set of a set ''S'', and the binomial-coefficient notation $\{S\; choose\; k\}$ for the set of all ''k''-element subsets of ''S''. One example where this convention does not seem to have been used yet is ''X''! for the set of all permutations of ''X'', which is the ground set for the symmetric group denoted ''S_X'' or Sym(''X'').

Structural combinatorics

There are many combinatorial patterns and theorems related to the structure of combinatoric sets. These often focus on a partition or ordered partition of a set. See the List of partition topics for an expanded list of related topics or the List of combinatorics topics for a more general listing. Some of the more notable results are highlighted below.

Design theory

A simple result in the block design area of combinatorics is that the problem of forming sets, described in the introduction, has a solution only if ''n'' has the form ''q''² + ''q'' + 1. It is less simple to prove that a solution exists if ''q'' is a prime power. It is conjectured that these are the ''only'' solutions. It has been further shown that if a solution exists for ''q'' congruent to 1 or 2 mod 4, then ''q'' is a sum of two square numbers. This last result, the Bruck-Ryser theorem, is proved by a combination of constructive methods based on finite fields and an application of quadratic forms.
When such a structure does exist, it is called a finite projective plane; thus showing how finite geometry and combinatorics intersect.

Ramsey theory

Ramsey theory states that any sufficiently large random configuration will contain some sort of order.
Frank P. Ramsey proved that, given any group of six people, it is always the case that one can find three people out of this group that either all know each other or all do not know each other.
A simpler and shorter proof: Take any of the six people, call him A. Either A knows three of the remaining people, or A does not know three of the remaining people. Assume the former (the proof is identical if we assume the latter). Let the three people that A knows be B, C, and D. Now either two people from {B,C,D} know each other (in which case we have a group of three people who know each other - these two plus A) or none of B,C,D know each other (in which case we have a group of three people who do not know each other - B,C,D). QED.
This is a special case of Ramsey's theorem.
The key to this proof is the use of the Pigeonhole Principle in the statement ''either A knows three of the remaining people, or A does not know three of the remaining people.''

Matroid theory

Matroid theory abstracts part of geometry. It studies the properties of sets (usually, finite sets) of vectors in a vector space that do not depend on the particular coefficients in a linear dependence relation. Not only the structure but also enumerative properties belong to matroid theory.
For instance, given a set of ''n'' vectors in Euclidean space, what is the largest number of planes they can generate? (Answer: the binomial coefficient ''C''(''n'',3).) Is there a set that generates exactly one less plane? (No, in almost all cases.) These are extremal questions in geometry.

Extremal combinatorics

Many extremal questions deal with set systems. A simple example is the following: what is the largest number of subsets of an ''n''-element set one can have, if no two of the subsets are disjoint? Answer: half the total number of subsets. Proof: Call the ''n''-element set ''S''. Between any subset ''T'' and its complement ''S'' − ''T'', at most one can be chosen. This proves the maximum number of chosen subsets is not greater than half the number of subsets. To show one can attain half the number, pick one element ''x'' of ''S'' and choose all the subsets that contain ''x''.
A more difficult problem is to characterize the extremal solutions; in this case, to show that no other choice of subsets can attain the maximum number while satisfying the requirement.
Often it is too hard even to find the extremal answer ''f''(''n'') exactly and one can only give an asymptotic estimate.

See also

★ Combinadic

★ Combinatorial auction

★ Combinatorial chemistry

★ Combinatorial explosion

★ Combinatorial principles

★ Factoradic

★ Fundamental theorem of combinatorial enumeration

★ Inclusion-exclusion principle

★ List of combinatorics topics

★

★ List of publications in mathematics

★ Method of distinguished element

★ Musical set theory

References

★ Bjorner, A. and Stanley, R.P., ''A Combinatorial Miscellany''

★ Graham, R.L., Groetschel M., and Lovász L., eds. (1996). ''Handbook of Combinatorics'', Volumes 1 and 2. Elsevier (North-Holland), Amsterdam, and MIT Press, Cambridge, Mass. ISBN 0-262-07169-X.

★ The Crest of the Peacock: Non-European Roots of Mathematics, , George Gheverghese, Joseph, Penguin Books, 2000, ISBN 0-14-012529-9

★ Katz, Victor J. (1998). ''A History of Mathematics: An Introduction'', 2nd Edition. Addison-Wesley Education Publishers. ISBN 0-321-01618-1.

★ Lindner, Charles C. and Christopher A. Rodger (eds.) ''Design Theory'', CRC-Press; 1st. edition (October 31, 1997). ISBN 0-8493-3986-3.

★ van Lint, J.H., and Wilson, R.M. (2001). ''A Course in Combinatorics'', 2nd Edition. Cambridge University Press. ISBN 0-521-80340-3.

★ O'Connor, John J. and Robertson, Edmund F. (1999-2004). ''MacTutor History of Mathematics archive''. St Andrews University.

★ Rashed, R. (1994). ''The development of Arabic mathematics: between arithmetic and algebra''. London.

★ Stanley, Richard P. (1997, 1999). ''Enumerative Combinatorics'', Volumes 1 and 2. Cambridge University Press. ISBN 0-521-55309-1, ISBN 0-521-56069-1.

★ Combinatorial Analysis – an article in Encyclopædia Britannica Eleventh Edition