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:
“We have wasted our spirit in the regions of the abstract and general just as the monks let it wither in the world of prayer and contemplation.”
—Alexander Herzen (1812–1870)
“...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)
“The philosopher is in advance of his age even in the outward form of his life. He is not fed, sheltered, clothed, warmed, like his contemporaries. How can a man be a philosopher and not maintain his vital heat by better methods than other men?”
—Henry David Thoreau (1817–1862)