000 03947cam a2200373Ii 4500
001 9781315153360
008 180706s2017 flua o 000 0 eng d
020 _a9781315153360
_q(e-book : PDF)
020 _a9781351633284
_q(e-book: Mobi)
020 _z9781498780254
_q(hardback)
024 7 _a10.1201/9781315153360
_2doi
035 _a(OCoLC)1003254149
040 _aFlBoTFG
_cFlBoTFG
_erda
050 4 _aQA164
_b.L64 2017
082 0 4 _a511.62
_bL825
100 1 _aLoehr, Nicholas A.,
_eauthor.
_913613
240 1 0 _aBijective combinatorics
245 1 0 _aCombinatorics /
_cNicholas A. Loehr.
250 _aSecond edition.
264 1 _aBoca Raton :
_bCRC Press,
_c2017.
300 _a1 online resource (xxiv, 618 pages)
336 _atext
_2rdacontent
337 _acomputer
_2rdamedia
338 _aonline resource
_2rdacarrier
500 _aPrevious edition: Bijective combinatorics / Nicholas A. Loehr (Boca Raton, FL : Chapman and Hall/CRC, c2011).
505 0 _apart Part I Counting -- chapter 1 Basic Counting -- chapter 2 Combinatorial Identities and Recursions -- chapter 3 Counting Problems in Graph Theory -- chapter 4 Inclusion-Exclusion, Involutions, and Mo¨bius Inversion -- chapter 5 Generating Functions -- chapter 6 Ranking, Unranking, and Successor Algorithms -- part Part II Algebraic Combinatorics -- chapter 7 Groups, Permutations, and Group Actions -- chapter 8 Permutation Statistics and Q-analogues -- chapter 9 Tableaux and Symmetric Polynomials -- chapter 10 Abaci and Antisymmetric Polynomials -- chapter 11 Algebraic Aspects of Generating Functions -- chapter 12 Additional Topics.
520 _aBijective proofs are some of the most elegant and powerful techniques in all of mathematics. Suitable for readers without prior background in algebra or combinatorics, the book presents an introduction to enumerative and algebraic combinatorics emphasizing bijective methods. The text develops mathematical tools, such as basic counting rules, recursions, inclusion-exclusion techniques, generating functions, bijective proofs, and linear-algebraic methods to solve enumeration problems. The tools are used to analyze combinatorial structures, words, permutations, subsets, functions, compositions, integer partitions, graphs, trees, lattice paths, multisets, rook placements, and set partitions. --
_cProvided by publisher.
520 _aCombinatorics, Second Edition is a well-rounded, general introduction to the subjects of enumerative, bijective, and algebraic combinatorics. The textbook emphasizes bijective proofs, which provide elegant solutions to counting problems by setting up one-to-one correspondences between two sets of combinatorial objects. The author has written the textbook to be accessible to readers without any prior background in abstract algebra or combinatorics. Part I of the second edition develops an array of mathematical tools to solve counting problems: basic counting rules, recursions, inclusion-exclusion techniques, generating functions, bijective proofs, and linear algebraic methods. These tools are used to analyze combinatorial structures such as words, permutations, subsets, functions, graphs, trees, lattice paths, and much more. Part II cover topics in algebraic combinatorics including group actions, permutation statistics, symmetric functions, and tableau combinatorics. This edition provides greater coverage of the use of ordinary and exponential generating functions as a problem-solving tool. Along with two new chapters, several new sections, and improved exposition throughout, the textbook is brimming with many examples and exercises of various levels of difficulty.
650 0 _aCombinatorial analysis.
_96897
700 1 _aLoehr, Nicholas A.
_tBijective combinatorics.
_913614
776 0 8 _iPrint version:
_z9781498780254
_w(DLC) 2017011283
856 4 0 _uhttps://www.taylorfrancis.com/books/9781315153360
_zClick here to view.
942 _cEBK
999 _c70485
_d70485