Category:Combinatorics
Here is a list of articles in the Combinatorics category of the Computing portal that unifies foundations of mathematics and computations using computers.
Combinatorics is a branch of mathematics that studies finite collections of objects that satisfy specified criteria, and is in particular concerned with "counting" the objects in those collections (enumerative combinatorics) and with deciding whether certain "optimal" objects exist (extremal combinatorics). One of the most prominent combinatorialists of recent times was Gian-Carlo Rota, who helped formalize the subject beginning in the 1960s. The problem-solver Paul Erdős worked mainly on extremal questions. The study of how to count objects is sometimes thought of separately as the field of enumeration.
Subcategories
This category has the following 22 subcategories, out of 22 total.
- Theorems in combinatorics (29 P)
A
- Additive combinatorics (19 P)
- Algebraic combinatorics (48 P)
C
- Combinatorial chemistry (9 P)
E
F
G
I
M
P
- Percolation theory (13 P)
- Polyhedral combinatorics (24 P)
Q
- Q-analogs (59 P)
R
S
- Set families (8 P)
- Sparse matrices (22 P)
T
- Triangles of numbers (30 P)
Pages in category "Combinatorics"
The following 200 pages are in this category, out of 201 total.
(previous page) (next page)*
A
B
C
- Cameron–Erdős conjecture
- Catalan's constant
- Chemistry:Combinatorial chemistry
- Chinese monoid
- Chip-firing game
- Cobham's theorem
- Coins in a fountain
- Combination
- Combinatorial class
- Combinatorial data analysis
- Combinatorial explosion
- Physics:Combinatorial hierarchy
- Combinatorial matrix theory
- Combinatorial modelling
- Combinatorial number system
- Combinatorial topology
- Composition (combinatorics)
- Constant-recursive sequence
- Constraint counting
- Counting lemma
- Covering problems
- Cycle index
- Cyclic order
- Cyclic sieving
D
E
F
H
I
L
- Langford pairing
- Large set (combinatorics)
- Largest small octagon
- Laver table
- Lehmer code
- Lindström–Gessel–Viennot lemma
- Linear recurrence with constant coefficients
- Littlewood–Offord problem
- Longest alternating subsequence
- Longest common subsequence
- Longest common subsequence problem
- Longest increasing subsequence
- Longest repeated substring problem
- Lottery mathematics
- Lovász local lemma
- Lubell–Yamamoto–Meshalkin inequality
M
P
- Partial permutation
- Partition (number theory)
- Partition of a set
- Pascal's rule
- Percolation
- Perfect ruler
- Sharp-P-completeness of 01-permanent
- ♯P-completeness of 01-permanent
- Petkovšek's algorithm
- Piecewise syndetic set
- Pigeonhole principle
- Plethystic substitution
- Polynomial method in combinatorics
- Probabilistic method
R
S
- Selberg sieve
- Semilinear set
- Sequential dynamical system
- Seriation (statistics)
- Series multisection
- Set packing
- Sharp-SAT
- Shortest common supersequence
- Shortest common supersequence problem
- Shuffle algebra
- Sicherman dice
- Sidon sequence
- Software:Sim (pencil game)
- Singmaster's conjecture
- Sparse ruler
- Sperner's lemma
- Spt function
- Stable marriage problem
- Stable roommates problem
- Star of David theorem
- Star product
- Stars and bars (combinatorics)
- Stirling permutation
- Sunflower (mathematics)
- Symbolic method (combinatorics)
- Symmetric function
