Bijective combinatorics

Bijective combinatorics

by Nicholas A. Loehr

Part of Discrete mathematics and its applications

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free
About
"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"-- "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"--

Discuss Bijective combinatorics with other readers

Join or start a book club for Bijective combinatorics on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Frequently asked questions

How do I join a book club for Bijective combinatorics?

Sign up free on Readfeed, then browse public clubs or start your own club with Bijective combinatorics as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Bijective combinatorics with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Bijective combinatorics with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.