Bijective Combinatorics.

Loehr, Nicholas A.:

ISBN 10: 143984884X / ISBN 13: 9781439848845

Published by CRC Press, Boca Raton, London, New York, 2011

About this Item

4° 590 pages with fig.; Orig.-Glanzfolienpappband; 1250g; [Deutsch]; fine 1. Auflage; _ x1x_.

Seller Inventory # 79157

Bibliographic Details

• Title: Bijective Combinatorics.
• Publisher: CRC Press, Boca Raton, London, New York
• Publication Date: 2011
• ISBN 10: 143984884X
• ISBN 13: 9781439848845
• Binding: Hardcover
• Edition: 1. Aufl.;.
• Condition: Sehr gut
• Weight: 1250 grams
• Book Type: BUCH
• Seller catalogs:
  • Mathematik

About this title

Synopsis

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.

About the Author

Nicholas A. Loehr teaches in the Department of Mathematics at Virginia Tech. His research interests include enumerative and algebraic combinatorics; symmetric and quasisymmetric functions; integer partitions, lattice paths, parking functions, and tableaux; bijective methods; and algorithm analysis.