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:
“Mathematics is merely the means to a general and ultimate knowledge of man.”
—Friedrich Nietzsche (1844–1900)
“It is always easier to fight for one’s principles than to live up to them.”
—Alfred Adler (1870–1937)
“I think it is a wise course for laborers to unite to defend their interests.... I think the employer who declines to deal with organized labor and to recognize it as a proper element in the settlement of wage controversies is behind the times.... Of course, when organized labor permits itself to sympathize with violent methods or undue duress, it is not entitled to our sympathy.”
—William Howard Taft (1857–1930)
Related Phrases
Related Words