000			02836nam a22002777a 4500
003			OSt
005			20250616095347.0
008			250613b |||||||| |||| 00| 0 hin d
020			_a9789349750302
040			_aNISER LIBRARY _beng _cNISER LIBRARY
082			_a519.11 _bWAG-F
100			_aWagner, Carl G.
245			_aFirst course in enumerative combinatorics
260			_aIndia : _bUniversities Press, _c2025.
300			_axvii, 272 pages : _billustrations ; _c26 cm
490			_aPure and applied undergraduate texts, _v49 _x1943-9334 ;
490			_aThe Sally series
504			_aIncludes bibliographical references and index.
520			_aA First Course in Enumerative Combinatorics provides an introduction to the fundamentals of enumeration for advanced undergraduates and beginning graduate students in the mathematical sciences. The book offers a careful and comprehensive account of the standard tools of enumeration—recursion, generating functions, sieve and inversion formulas, enumeration under group actions—and their application to counting problems for the fundamental structures of discrete mathematics, including sets and multisets, words and permutations, partitions of sets and integers, and graphs and trees. The author's exposition has been strongly influenced by the work of Rota and Stanley, highlighting bijective proofs, partially ordered sets, and an emphasis on organizing the subject under various unifying themes, including the theory of incidence algebras. In addition, there are distinctive chapters on the combinatorics of finite vector spaces, a detailed account of formal power series, and combinatorial number theory. The reader is assumed to have a knowledge of basic linear algebra and some familiarity with power series. There are over 200 well-designed exercises ranging in difficulty from straightforward to challenging. There are also sixteen large-scale honors projects on special topics appearing throughout the text. The author is a distinguished combinatorialist and award-winning teacher, and he is currently Professor Emeritus of Mathematics and Adjunct Professor of Philosophy at the University of Tennessee. He has published widely in number theory, combinatorics, probability, decision theory, and formal epistemology. His Erdős number is 2.
521			_aReadership: Undergraduate and graduate students interested in combinatorics.
650			_aCombinatorial enumeration problems
650			_aCombinatorics
856			_3Table of contents _uhttps://www.ams.org/bookstore/pspdf/amstext-49-toc.pdf?_gl=1*1jeizwi*_ga*NzkyMDE0ODczLjE3NTAwNDYzMjU.*_ga_26G4XFTR63*czE3NTAwNDYzMjQkbzEkZzEkdDE3NTAwNDY0MDAkajU4JGwwJGgw
856			_3Reviews _uhttps://www.goodreads.com/book/show/55722553-a-first-course-in-enumerative-combinatorics#CommunityReviews
942			_2udc _cN
999			_c36051 _d36051