Index of combinatorics articles
A
B
- Barcode
- Matrix code
- QR Code
- Universal Product Code
- Bell polynomials
- Bertrand's ballot theorem
- Binary matrix
- Binomial theorem
- Block design
- Block walking
- Boolean satisfiability problem
- Bracelet (combinatorics)
- Bruck–Chowla–Ryser theorem
C
D
- Data integrity
- Alternating bit protocol
- Checksum
- Cyclic redundancy check
- Luhn formula
- Error detection
- Error-detecting code
- Error-detecting system
- Message digest
- Redundancy check
- Summation check
- De Bruijn sequence
- Deadlock
- Delannoy number
- Derangement
- Dickson's lemma
- Dinitz conjecture
- Discrete optimization
- Dobinski's formula
E
- Eight queens puzzle
- Entropy coding
- Enumeration
- Algebraic enumeration
- Combinatorial enumeration
- Burnside's lemma
- Erdős–Ko–Rado theorem
- Euler number
F
G
- Game theory
- Combinatorial game theory
- Combinatorial game theory (history)
- Combinatorial game theory (pedagogy)
- Star (game theory)
- Zero game, fuzzy game
- Dots and Boxes
- Impartial game
- Partizan game
- Solved board games
- Col game
- Sim (pencil game)
- Sprouts (game)
- Surreal numbers
- Transposition table
- Black Path Game
- Sylver coinage
- Combinatorial 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
- Hash collision
- Perfect hash function
- Hat problem
- Heilbronn triangle problem
- Helly family
- Hypergeometric function identities
- Hypergeometric series
- Hypergraph
I
- Incidence structure
- Integer partition
- Ferrers graph
K
- Kakeya needle problem
- Kirkman's schoolgirl problem
- Knapsack problem
- Kruskal–Katona theorem
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
- Enumerations of specific permutation classes
- Josephus permutation
- Permutation matrix
- Permutation pattern
- Permutations and combinations
- Shuffling playing cards
- 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
- Binary search
- Interpolation search
- Linear search
- Local search
- String searching algorithm
- Aho–Corasick string matching algorithm
- Fuzzy string searching
- grep, agrep, wildcard character
- Knuth–Morris–Pratt 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
U
- Union-closed sets conjecture
- Urn problems (probability)
W
- Weighing matrices
- Weighted round robin
- Wigner–d'Espagnat inequality
Y
gollark: Okay, rearrange the states so they're square.
gollark: A simple if slightly inaccurate way would be some kind of binary space partitioning thing, where (pretending the US is a perfect square) you just repeatedly divide it in half (alternatingly vertically/horizontally), but stop dividing a particular subregion when population goes below some target number.
gollark: The more complex the algorithm the more people might try and manipulate it. The obvious* solution is to just split up the country by latitude/longitude grid squares.
gollark: The Netherlands will just conquer all of the areas "lost" to rising sea levels.
gollark: (well, energy generally)
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.