Bijective combinatorics
 Responsibility
 Nicholas A. Loehr.
 Imprint
 Boca Raton, FL : Chapman & Hall/CRC, c2011.
 Physical description
 xxii, 590 p. : ill. ; 27 cm.
 Series
 Discrete mathematics and its applications.
Access
Available online
SAL3 (offcampus storage)
Stacks
Request
Call number  Status 

QA164 .L64 2011  Available 
More options
Creators/Contributors
 Author/Creator
 Loehr, Nicholas A.
Contents/Summary
 Bibliography
 Includes bibliographical references (p. 569576) and index.
 Contents

 Introduction Basic Counting Review of Set Theory Sum Rule Product Rule Words, Permutations, and Subsets Functions Bijections, Cardinality, and Counting Subsets, Binary Words, and Compositions Subsets of a Fixed Size Anagrams Lattice Paths Multisets Probability Games of Chance Conditional Probability and Independence Combinatorial Identities and Recursions Generalized Distributive Law Multinomial and Binomial Theorems Combinatorial Proofs Recursions Recursions for Multisets and Anagrams Recursions for Lattice Paths Catalan Recursions Integer Partitions Set Partitions Surjections Stirling Numbers and Rook Theory Linear Algebra Review Stirling Numbers and Polynomials Combinatorial Proofs of Polynomial Identities Counting Problems in Graph Theory Graphs and Digraphs Walks and Matrices DAG's and Nilpotent Matrices Vertex Degrees Functional Digraphs Cycle Structure of Permutations Counting Rooted Trees Connectedness and Components Forests Trees Counting Trees Pruning Maps Ordered Trees and Terms Ordered Forests and Lists of Terms Graph Coloring Spanning Trees MatrixTree Theorem Eulerian Tours InclusionExclusion and Related Techniques Involutions The InclusionExclusion Formula More Proofs of InclusionExclusion Applications of the InclusionExclusion Formula Derangements Coefficients of Chromatic Polynomials Classical Mobius Inversion Partially Ordered Sets Mobius Inversion for Posets Product Posets Ranking and Unranking Ranking, Unranking, and Related Problems Bijective Sum Rule Bijective Product Rule Ranking Words Ranking Permutations Ranking Subsets Ranking Anagrams Ranking Integer Partitions Ranking Set Partitions Ranking Card Hands Ranking Dyck Paths Ranking Trees Successors and Predecessors Random Selection Counting Weighted Objects Weighted Sets Inversions WeightPreserving Bijections Sum and Product Rules for Weighted Sets Inversions and Quantum Factorials Descents and Major Index Quantum Binomial Coefficients Quantum Multinomial Coefficients Foata's Map Quantum Catalan Numbers Formal Power Series The Ring of Formal Power Series Finite Products and Powers of Formal Series Formal Polynomials Order of Formal Power Series Formal Limits, Infinite Sums, and Infinite Products Multiplicative Inverses in K[x] and K[[x]] Formal Laurent Series Formal Derivatives Composition of Polynomials Composition of Formal Power Series Generalized Binomial Expansion Generalized Powers of Formal Series Partial Fraction Expansions Application to Recursions Formal Exponentiation and Formal Logarithms Multivariable Polynomials and Formal Series The Combinatorics of Formal Power Series Sum Rule for Infinite Weighted Sets Product Rule for Infinite Weighted Sets Generating Functions for Trees Compositional Inversion Formulas Generating Functions for Partitions Partition Bijections Euler's Pentagonal Number Theorem Stirling Numbers of the First Kind Stirling Numbers of the Second Kind The Exponential Formula Permutations and Group Actions Definition and Examples of Groups Basic Properties of Groups Notation for Permutations Inversions and Sign Determinants Multilinearity and Laplace Expansions CauchyBinet Formula Subgroups Automorphism Groups of Graphs Group Homomorphisms Group Actions Permutation Representations Stable Subsets and Orbits Cosets The Size of an Orbit Conjugacy Classes in Sn Applications of the Orbit Size Formula The Number of Orbits Polya's Formula Tableaux and Symmetric Polynomials Partition Diagrams and Skew Shapes Tableaux Schur Polynomials Symmetric Polynomials Homogeneous Symmetric Polynomials Symmetry of Schur Polynomials Orderings on Partitions Schur Bases Tableau Insertion Reverse Insertion Bumping Comparison Theorem Pieri Rules Schur Expansion of halpha Schur Expansion of ealpha Algebraic Independence PowerSum Symmetric Polynomials Relations between e's and h's Generating Functions for e's and h's Relations between p's, e's, and h's PowerSum Expansion of hn and en The Involution omega Permutations and Tableaux Words and Tableaux Matrices and Tableaux Cauchy Identities Dual Bases Abaci and Antisymmetric Polynomials Abaci and Integer Partitions Jacobi Triple Product Identity Ribbons and kCores kQuotients and Hooks Antisymmetric Polynomials Labeled Abaci Pieri Rule for pk Pieri Rule for ek Pieri Rule for hk Antisymmetric Polynomials and Schur Polynomials RimHook Tableaux Abaci and Tableaux Skew Schur Polynomials JacobiTrudi Formulas Inverse Kostka Matrix Schur Expansion of Skew Schur Polynomials Products of Schur Polynomials Additional Topics Cyclic Shifting of Paths ChungFeller Theorem RookEquivalence of Ferrers Boards Parking Functions Parking Functions and Trees Mobius Inversion and Field Theory Quantum Binomial Coefficients and Subspaces Tangent and Secant Numbers Tournaments and the Vandermonde Determinant HookLength Formula Knuth Equivalence Pfaffians and Perfect Matchings Domino Tilings of Rectangles Answers and Hints to Selected Exercises Bibliography Index A Summary and Exercises appear at the end of each chapter.
 (source: Nielsen Book Data)9781439848845 20160606
 Publisher's Summary
 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 tools, such as basic counting rules, recursions, inclusionexclusion techniques, generating functions, bijective proofs, and linearalgebraic methods, needed to solve enumeration problems. These tools are used to analyze many combinatorial structures, including words, permutations, subsets, functions, compositions, integer partitions, graphs, trees, lattice paths, multisets, rook placements, set partitions, Eulerian tours, derangements, posets, tilings, and abaci. The book also delves into algebraic aspects of combinatorics, offering detailed treatments of formal power series, symmetric groups, group actions, symmetric polynomials, determinants, and the combinatorial calculus of tableaux. Each chapter includes summaries and extensive problem sets that review and reinforce the material. Lucid, engaging, yet fully rigorous, this text describes a host of combinatorial techniques to help solve complicated enumeration problems. It covers the basic principles of enumeration, giving due attention to the role of bijective proofs in enumeration theory.
(source: Nielsen Book Data)9781439848845 20160606
Subjects
 Subject
 Combinatorial analysis.
Bibliographic information
 Publication date
 2011
 Series
 Discrete mathematics and its applications
 Note
 "A Chapman & Hall book."
 ISBN
 9781439848845 (hardback)
 143984884X (hardback)