Index of combinatorics articles
A
- Abstract simplicial complex
- Addition chain
- Algebraic combinatorics
- Alternating sign matrix
- Almost disjoint sets
- Antichain
- Arrangement of hyperplanes
- Assignment problem
- Audioactive decay
B
- Barcode
- Bell polynomials
- Bertrand's ballot theorem
- Binary matrix
- Binomial theorem
- Block design
- Block walking
- Boolean satisfiability problem
- Bracelet (combinatorics)
- Bruck–Chowla–Ryser theorem
C
- Catalan number
- Cellular automaton
- Collatz conjecture
- Combination
- Combinatorial design
- Combinatorial number system
- Combinatorial optimization
- Combinatorial search
- Constraint satisfaction problem
- Conway's Game of Life
- Cycles and fixed points
- Cyclic order
- Cyclic permutation
- Cyclotomic identity
D
- Data integrity
- De Bruijn sequence
- Deadlock
- Delannoy number
- Derangement
- Dickson's lemma
- Dinitz conjecture
- Discrete optimization
- Dobinski's formula
E
F
- Faà di Bruno's formula
- Factorial number system
- Family of sets
- Faulhaber's formula
- Fifteen puzzle
- Finite geometry
- Finite intersection property
G
- Game theory
- Generating function
- Golomb coding
- Golomb ruler
- Graeco-Latin square
- Gray code
H
- Hadamard matrices
- Complex Hadamard matrices
- Butson-type Hadamard matrices
- Generalized Hadamard matrices
- Regular Hadamard matrices
- Hall's marriage theorem
- Hamming distance
- Hash function
- Hat problem
- Heilbronn triangle problem
- Helly family
- Hypergeometric function identities
- Hypergeometric series
- Hypergraph
I
K
L
- Lagrange inversion theorem
- Lagrange reversion theorem
- Lah number
- Large number
- Latin square
- Levenshtein distance
- Lexicographical order
- Littlewood–Offord problem
- Lubell–Yamamoto–Meshalkin inequality (known as the LYM inequality)
- Lucas chain
M
- MacMahon Master theorem
- Magic square
- Matroid embedding
- Monge array
- Monomial order
- Moreau's necklace-counting function
- Motzkin number
- Multiplicities of entries in Pascal's triangle
- Multiset
- Munkres' assignment algorithm
N
O
- Ordered partition of a set
- Orthogonal design
- Complex orthogonal design
- Quaternion orthogonal design
P
- Packing problem
- Partition of a set
- Permanent
- Permutation
- Pochhammer symbol
- Polyforms
- Polycubes
- Polyiamonds
- Polyominoes
- Polysquare puzzle
- Projective plane
- Property B
- Prüfer sequence
Q
- q-analog
- q-binomial theorem—see Gaussian binomial coefficient
- q-derivative
- q-series
- q-theta function
- q-Vandermonde identity
R
S
- Schröder number
- Search algorithm
- Sequences with zero autocorrelation function
- Series-parallel networks problem
- Set cover problem
- Shuffling puzzle
- Small set (combinatorics)
- Sparse matrix, Sparse array
- Sperner family
- Sperner's lemma
- Stable marriage problem
- Steiner system
- Stirling number
- String algorithm
- Straddling checkerboard
- Subsequence
- Subset sum problem
- Symmetric functions
- Szemerédi's theorem
T
U
- Union-closed sets conjecture
- Urn problems (probability)
V
W
Y
This article is issued from Wikipedia - version of the Thursday, May 14, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.