A First Course in Enumerative Combinatorics (Pure and Applied Undergraduate Texts, 49)
5 Great reasons to buy from us:
A 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.
![]() |
Please allow 10 days for your order to arrive. You will receive a tracking number for your order via email. To keep prices low we ship via the US Postal Service. This means sometimes you have to wait a little longer to get your order but it's always worth it! |
|
![]() |
Returns are easy, simply contact us and send your item to our returns centre for fast processing. We'll get you a replacement or refund in a snap! |
![]() |
You get a full 30 days to return your item to us. If it doesn't fit, it breaks, you've changed your mind or for no reason whatsoever simply send it back to us and we'll cheerfully refund you 100% of your order. |
|
![]() |
Returns are easy, simply contact us for a returns number and send your item to our returns centre for fast processing. We'll get you a replacement or refund in a snap! |
|
![]() |
In the unlikely event that you find your item cheaper at another online store, just let us know and we'll beat the competitor's pricing hands-down. |
|
![]() |
We insist that you love everything you buy from us. If you're unhappy for any reason whatsoever, just let us know and we'll bend over backwards to make things right again. |
|
![]() |
Ordering from Biblestore is 100% safe and secure so you can rest easy. Your personal details are never shared, sold or rented to anyone either. |
A 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.
![]() |
Please allow 10 days for your order to arrive. You will receive a tracking number for your order via email. To keep prices low we ship via the US Postal Service. This means sometimes you have to wait a little longer to get your order but it's always worth it! |
|
![]() |
Returns are easy, simply contact us and send your item to our returns centre for fast processing. We'll get you a replacement or refund in a snap! |
![]() |
You get a full 30 days to return your item to us. If it doesn't fit, it breaks, you've changed your mind or for no reason whatsoever simply send it back to us and we'll cheerfully refund you 100% of your order. |
|
![]() |
Returns are easy, simply contact us for a returns number and send your item to our returns centre for fast processing. We'll get you a replacement or refund in a snap! |
|
![]() |
In the unlikely event that you find your item cheaper at another online store, just let us know and we'll beat the competitor's pricing hands-down. |
|
![]() |
We insist that you love everything you buy from us. If you're unhappy for any reason whatsoever, just let us know and we'll bend over backwards to make things right again. |
|
![]() |
Ordering from Biblestore is 100% safe and secure so you can rest easy. Your personal details are never shared, sold or rented to anyone either. |