000			03428cam a22003254a 4500
005			20250918153147.0
008			120414s2011 flua b 001 0 eng
020			_a9781439848845 (hardback) _cRM317.39
020			_a143984884X (hardback)
039		9	_a201207051519 _bariff _c201206202112 _dmazarita _y04-14-2012 _zmazarita
040			_aUKM
090			_aQA164.L636
090			_aQA164 _b.L636
100	1		_aLoehr, Nicholas A.
245	1	0	_aBijective combinatorics / _cNicholas A. Loehr.
260			_aBoca Raton, FL : _bChapman & Hall/CRC, _c2011.
300			_axxii, 590 p. : _bill. ; _c27 cm.
490	1		_aDiscrete mathematics and its applications
504			_aIncludes bibliographical references and index.
520			_a'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'-- _cProvided by publisher.
520			_a'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'-- _cProvided by publisher.
650		0	_aCombinatorial analysis.
830		0	_aDiscrete mathematics and its applications.
907			_a.b1532641x _b2021-05-28 _c2019-11-12
942			_c01 _n0 _kQA164.L636
914			_avtls003496761
991			_aFakulti Teknologi dan Sains Maklumat
998			_at _b2012-01-04 _cm _da _feng _gflu _y0 _z.b1532641x
999			_c516473 _d516473