Nicholas Loehr

Chapman and Hall/CRC

Published
February 10, 2011

Textbook
- 612 Pages
- 118 B/W Illustrations

ISBN 9781439848869 - CAT# KE12250

Series: Discrete Mathematics and Its Applications

**For Instructors** Request Inspection Copy

**For Librarians** Available on Taylor & Francis eBooks >>

was $118.95

USD^{$}95^{.16}

SAVE *~*$23.79

Add to Wish List

FREE Standard Shipping!

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, inclusion-exclusion techniques, generating functions, bijective proofs, and linear-algebraic 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.

We provide complimentary e-inspection copies of primary textbooks to instructors considering our books for course adoption.

Request an

e-inspection copy

e-inspection copy