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:
“The general will is always right.”
—Jean-Jacques Rousseau (1712–1778)
“The scope of modern government in what it can and ought to accomplish for its people has been widened far beyond the principles laid down by the old “laissez faire” school of political rights, and the widening has met popular approval.”
—William Howard Taft (1857–1930)
“A woman might claim to retain some of the child’s faculties, although very limited and defused, simply because she has not been encouraged to learn methods of thought and develop a disciplined mind. As long as education remains largely induction ignorance will retain these advantages over learning and it is time that women impudently put them to work.”
—Germaine Greer (b. 1939)