000			02849cam a2200325 i 4500
005			20220629125322.0
008			170308t20172017flua 000 0 eng
020			_a9781498780254
028			_a:Zafaa Books & Distributors _b:313/56F 49A, Anand Nagar Inderlok Delhi 110035 _c:ZBD0276 _d;18/06/2022
042			_apcc
082	0	0	_a511.62 LOE _223
100	1		_aLoehr, Nicholas A.
245	1	0	_aCombinatorics _c/ Nicholas A. Loehr
250			_a2nd Ed.
260			_aBoca Raton _b : CRC Press, _c©2018
300			_axxiv, 618p. _billustrations _c:27 cm.
365			_b10049
490	0		_aDiscrete mathematics and its applications
505			_a Basic counting -- Combinatorial identities and recursions -- Counting problems in graph theory -- Inclusion-exclusion, involutions, and Möbius inversion -- Generating functions -- Ranking, unranking, and successor algorithms -- Groups, permutations, and group actions -- Permutation statistics and q-analogues -- Tableaux and symmetric polynomials -- Abaci and antisymmetric polynomials -- Algebraic aspects of generating functions -- Additional topics.
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."--Provided by publisher.
650		0	_aMathematics
650		0	_aGeneral principles of mathematics
650		0	_aCombinatorial analysis.
650		0	_aAnalyse combinatoire.
650		0	_aMathematics - Applied.
700	1		_aLoehr, Nicholas A.
906			_a7 _bcbc _corignew _d1 _eecip _f20 _gy-gencatlg
942			_cMDL
999			_c59448 _d59448