ABSTRACT

Bijective proofs are some of the most elegant and powerful techniques in all of mathematics. Suitable for readers without prior background in algebra or combinatorics, Bijective Combinatorics presents a general introduction to enumerative and algebraic combinatorics that emphasizes bijective methods.The text systematically develops the mathematical

chapter 1|40 pages

Basic Counting

chapter 2|56 pages

Combinatorial Identities and Recursions

chapter 3|56 pages

Counting Problems in Graph Theory

chapter 4|28 pages

Inclusion-Exclusion and Related Techniques

chapter 5|32 pages

Ranking and Unranking

chapter 6|30 pages

Counting Weighted Objects

chapter 7|48 pages

Formal Power Series

chapter 8|28 pages

The Combinatorics of Formal Power Series

chapter 9|58 pages

Permutations and Group Actions

chapter 10|68 pages

Tableaux and Symmetric Polynomials

chapter 11|52 pages

Abaci and Antisymmetric Polynomials

chapter 12|58 pages

Additional Topics