Mardigian Library
Ask a QuestionMy Library Account
Search Library Catalog - Books, DVDs & More
Limit to available
More Searches
   
Limit results to available items
Find more results:
Search MelCat
More Information
  
Loehr, Nicholas A
Bijective combinatorics / Nicholas A. Loehr
Boca Raton, FL : Chapman & Hall/CRC, c2011
book jacket
Location Call Number Status
 4th Floor  QA164 .L64 2011    AVAILABLE
Subject(s) Combinatorial analysis
Combinatorial enumeration problems
Physical Description xxii, 590 p. : ill. ; 27 cm
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
Note Includes bibliographical references (p. 569-576) and index
Series Discrete mathematics and its applications

Mardigian Library, 4901 Evergreen Rd.
Dearborn, MI 48128-1491 313-593-5400 fax 313-593-5561
ask-a-question@umd.umich.edu
The Regents of the University of Michigan | Non-Discrimination Policy
Copyright © The University of Michigan - Dearborn • 4901 Evergreen Road • Dearborn, Michigan 48128 • 313-593-5000
The University of Michigan - Ann Arbor | The University of Michigan - Flint | SITEMAP | DIRECTORY | CONTACT