Category:Combinatorics
![]() | Computing portal |
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 20 subcategories, out of 20 total.
A
C
E
F
G
I
M
P
Q
R
S
Pages in category "Combinatorics"
The following 191 pages are in this category, out of 191 total.
- Combinatorics (computing)
*
- Combinatorial principles (computing)
- Combinatorics and dynamical systems (computing)
- Combinatorics and physics (physics)
- Extremal combinatorics (computing)
+
- History of combinatorics (computing)
- Index of combinatorics articles (computing)
- Outline of combinatorics (computing)
3
- 3-dimensional matching (computing)
A
- Aanderaa–Karp–Rosenberg conjecture (computing)
- Algorithmic Lovász local lemma (computing)
- Algorithms and Combinatorics (computing)
- Alignments of random points (astronomy)
- All-pairs testing (computing)
- Arrangement of hyperplanes (computing)
- De Arte Combinatoria (computing)
B
- Baker–Campbell–Hausdorff formula (computing)
- Barycentric-sum problem (computing)
- Bent function (computing)
- Bhargava factorial (computing)
- Binomial coefficient (computing)
- Combinatorial biology (biology)
- Block design (computing)
- Block walking (computing)
- Blocking set (computing)
- Borsuk–Ulam theorem (computing)
- Butcher group (computing)
C
- Cameron–Erdős conjecture (computing)
- Catalan's constant (computing)
- Combinatorial chemistry (chemistry)
- Chinese monoid (computing)
- Chip-firing game (computing)
- Coins in a fountain (computing)
- Combination (computing)
- Combinatorial class (computing)
- Combinatorial data analysis (computing)
- Combinatorial explosion (computing)
- Combinatorial hierarchy (physics)
- Combinatorial matrix theory (computing)
- Combinatorial modelling (computing)
- Combinatorial number system (computing)
- Combinatorial topology (computing)
- Composition (combinatorics) (computing)
- Constraint counting (computing)
- Covering problems (computing)
- Crank of a partition (computing)
- Cycle index (computing)
- Cyclic order (computing)
- Cyclic sieving (computing)
D
- De Bruijn torus (computing)
- Delannoy number (computing)
- Dickson's lemma (computing)
- Difference set (computing)
- DIMACS (computing)
- Dinitz conjecture (computing)
- Discrepancy theory (computing)
- Discrete Morse theory (computing)
- Disjunct matrix (computing)
- Dittert conjecture (computing)
- Dividing a circle into areas (computing)
- Dobiński's formula (computing)
- Domino tiling (computing)
E
- Equiangular lines (computing)
- Erdős conjecture on arithmetic progressions (computing)
- Erdős–Graham problem (computing)
- Erdős–Szemerédi theorem (computing)
- Extremal Problems For Finite Sets (computing)
F
- Factorial (computing)
- Factorial number system (computing)
- Finite geometry (computing)
- Finite topological space (computing)
- First passage percolation (computing)
- Fishburn–Shepp inequality (computing)
- Free convolution (computing)
G
- Generalized arithmetic progression (computing)
- Geometric combinatorics (computing)
- Glaisher's theorem (computing)
- Graph dynamical system (computing)
- Group testing (computing)
H
- Hafnian (computing)
- Hall-Littlewood polynomial (computing)
- Hook length formula (computing)
- Hunt–McIlroy algorithm (computing)
- Hunt–Szymanski algorithm (computing)
I
- Ideal ring bundle (computing)
- Incidence matrix (computing)
- Incidence structure (computing)
- Independence system (computing)
- Infinitary combinatorics (computing)
- Interval order (computing)
- Inversion (discrete mathematics) (computing)
- Isolation lemma (computing)
J
- Johnson scheme (computing)
- Josephus problem (computing)
K
- Kalmanson combinatorial conditions (computing)
- Kemnitz's conjecture (computing)
- Athanasius Kircher (biography)
- Ky Fan lemma (computing)
L
- Langford pairing (computing)
- Large set (combinatorics) (computing)
- Laver table (computing)
- Lehmer code (computing)
- Lindström–Gessel–Viennot lemma (computing)
- Littlewood–Offord problem (computing)
- Longest alternating subsequence (computing)
- Longest common subsequence problem (computing)
- Longest increasing subsequence (computing)
- Longest repeated substring problem (computing)
- Lottery mathematics (computing)
- Lovász local lemma (computing)
- Lubell–Yamamoto–Meshalkin inequality (computing)
M
- M. Lothaire (computing)
- Markov spectrum (computing)
- Meander (mathematics) (computing)
- Method of distinguished element (computing)
- Multi-index notation (computing)
- Multipartition (computing)
- Murnaghan–Nakayama rule (computing)
- Musikalisches Würfelspiel (computing)
N
- National Resident Matching Program (computing)
- Natural density (computing)
- No-three-in-line problem (computing)
O
- Orthogonal array (computing)
P
- Partial permutation (computing)
- Partition (number theory) (computing)
- Partition of a set (computing)
- Pascal's rule (computing)
- Percolation (computing)
- Perfect ruler (computing)
- Sharp-P-completeness of 01-permanent (computing)
- ♯P-completeness of 01-permanent (computing)
- Petkovšek's algorithm (computing)
- Piecewise syndetic set (computing)
- Pigeonhole principle (computing)
- Plethystic substitution (computing)
- Polynomial method in combinatorics (computing)
- Probabilistic method (computing)
Q
- Q-analog (computing)
- Q-Vandermonde identity (computing)
R
- Random permutation statistics (computing)
- Rank of a partition (computing)
- Recurrence relation (computing)
- Riordan array (computing)
- Road coloring theorem (computing)
- Rota–Baxter algebra (computing)
- Rudin's conjecture (computing)
- Rule of division (combinatorics) (computing)
- Rule of product (computing)
- Rule of sum (computing)
S
- Selberg sieve (computing)
- Semilinear set (computing)
- Sequential dynamical system (computing)
- Seriation (statistics) (computing)
- Series multisection (computing)
- Set packing (computing)
- Sharp-SAT (computing)
- Shortest common supersequence problem (computing)
- Shuffle algebra (computing)
- Sicherman dice (computing)
- Sidon sequence (computing)
- Sim (pencil game) (software)
- Singmaster's conjecture (computing)
- Solid partition (computing)
- Sparse ruler (computing)
- Sperner's lemma (computing)
- Spt function (computing)
- Stable marriage problem (computing)
- Stable roommates problem (computing)
- Star of David theorem (computing)
- Star product (computing)
- Stars and bars (combinatorics) (computing)
- Stirling permutation (computing)
- Sunflower (mathematics) (computing)
- Symbolic method (combinatorics) (computing)
- Symmetric function (computing)
T
- Toida's conjecture (computing)
- Toothpick sequence (computing)
- Topological combinatorics (computing)
- Trace monoid (computing)
- Transversal (combinatorics) (computing)
- Transylvania lottery (computing)
- Tucker's lemma (computing)
- Turan sieve (computing)
- Twelvefold way (computing)
U
- Umbral calculus (computing)
- Uniform convergence in probability (computing)
- Using the Borsuk–Ulam Theorem (computing)
V
- Virtual knot (computing)
W
- Weighing matrix (computing)
- Wilf–Zeilberger pair (computing)
Z
- Zero-sum problem (computing)