000			02026nam a22002297a 4500
005			20250311162009.0
008			250311b |||||||| |||| 00| 0 eng d
020			_a9781032476711
028			_a: Technical Bureau India Pvt. Ltd. _b: 4794/23, Eye 7, Ansari Road, New Delhi _c: TB4443 _d: 10/03/2025
082			_a519.1 LOE
100			_aLoehr, Nicholas A.
245			_aCombinatorics _b: Discrete Mathematics and its Applications. _c/ Nicholas A. Loehr.
260			_a, New york _b: CRC Press _c, 2022.
300			_axxiv, 618p. _c: 24cm.
365			_b3452
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			_aDiscrete Mathematics
650			_aAlgebraic combinatorics
650			_aAbstract algebra
700			_aNicholas A Loehr.
942			_cBOOK
999			_c62924 _d62924