General Combinatorial Principles and Methods
- Combinatorial principles
- Trial and error, brute force search, bogosort, British Museum algorithm
- Pigeonhole principle
- Method of distinguished element
- Mathematical induction
- Recurrence relation, telescoping series
- Generating functions as an application of formal power series
- Schrödinger method
- exponential generating function
- Stanley's reciprocity theorem
- Binomial coefficients and their properties
- Combinatorial proof
- Double counting (proof technique)
- Bijective proof
- Inclusion-exclusion principle
- Möbius inversion formula
- Parity, even and odd permutations
- Combinatorial Nullstellensatz
- Incidence algebra
- Greedy algorithm
- Divide and conquer algorithm
- Akra-Bazzi method
- Dynamic programming
- Branch and bound
- Birthday attack, birthday paradox
- Floyd's cycle-finding algorithm
- Reduction to linear algebra
- Sparsity
- Weight function
- Minimax algorithm
- Alpha-beta pruning
- Probabilistic method
- Sieve methods
- Analytic combinatorics
- Symbolic combinatorics
- Combinatorial class
- Exponential formula
- Twelvefold way
- MacMahon Master theorem
Read more about this topic: Outline Of Combinatorics
Famous quotes containing the words general, principles and/or methods:
“However energetically society in general may strive to make all the citizens equal and alike, the personal pride of each individual will always make him try to escape from the common level, and he will form some inequality somewhere to his own profit.”
—Alexis de Tocqueville (1805–1859)
“...at this stage in the advancement of women the best policy for them is not to talk much about the abstract principles of women’s rights but to do good work in any job they get, better work if possible than their male colleagues.”
—Virginia Crocheron Gildersleeve (1877–1965)
“All men are equally proud. The only difference is that not all take the same methods of showing it.”
—François, Duc De La Rochefoucauld (1613–1680)