jump to search box

Bijective combinatorics / Nicholas A. Loehr.

Availability

At the Library

Other libraries

Author/Creator:
Loehr, Nicholas A.
Language:
English.
Publication date:
2011
Imprint:
Boca Raton, FL : Chapman & Hall/CRC, c2011.
Format:
  • Book
  • xxii, 590 p. : ill. ; 27 cm.
Note:
"A Chapman & Hall book."
Bibliography:
Includes bibliographical references (p. 569-576) and index.
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, 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"-- Provided by publisher. "This book presents a general introduction to enumerative combinatorics that emphasizes bijective methods. The text contains a systematic development of the mathematical tools needed to solve enumeration problems: basic counting rules, recursions, inclusion-exclusion techniques, generating functions, bijective proofs, and linear-algebraic methods. 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. Later chapters delve into some of the algebraic aspects of combinatorics, including detailed treatments of formal power series, symmetric groups, group actions, symmetric polynomials, determinants, and the combinatorial calculus of tableaux"-- Provided by publisher.
Series:
Discrete mathematics and its applications.
Subjects:
ISBN:
9781439848845
143984884X

powered by Blacklight
© Stanford University. Stanford, California 94305. (650) 725-1064. Terms of Use | Copyright Complaints | Opt Out of Analytics
jump to top