Combinatorial Enumeration (Dover Books on Mathematics) [Paperback]

Ian P. Goulden (Author), David M. Jackson (Author)

Book Description

Publication Date: June 23, 2004 | Series: Dover Books on Mathematics

This graduate-level text presents mathematical theory and problem-solving techniques associated with enumeration problems. Subjects include the combinatorics of the ordinary generating function and the exponential generating function, the combinatorics of sequences, and the combinatorics of paths. The text is complemented by approximately 350 exercises with full solutions. 1983 edition. Foreword by Gian-Carlo Rota. References. Index.

Product Details

• Paperback: 608 pages
• Publisher: Dover Publications (June 23, 2004)
• Language: English
• ISBN-10: 0486435970
• ISBN-13: 978-0486435978
• Product Dimensions: 8.5 x 5.4 x 1.2 inches
• Shipping Weight: 1.3 pounds (View shipping rates and policies)
• Average Customer Review: 4.0 out of 5 stars  See all reviews (1 customer review)
• Amazon Best Sellers Rank: #984,488 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

1 of 1 people found the following review helpful:

4.0 out of 5 stars Succinct for sure, but not short!, June 28, 2011

By 

JonShops (Oklahoma) - See all my reviews

Amazon Verified Purchase

This review is from: Combinatorial Enumeration (Dover Books on Mathematics) (Paperback)

Keep in mind I am not a mathematician, and this book ought to be outside my reach, but I come to generator functions through a particular project which has sparked further interest. In this field finding texts is not that easy, nor is finding someone who has an ability to teach from them, so as I just start out reading this book I am amazed, given the density of the text, at how much I can pull out--that to its credit, not mine. Again, though, with the paucity of texts in this area this text could be a little more complete on setting the foundations by templating the ideas against stock examples.

It is not for the faint of heart in things mathematical, to be sure. If you don't already grasp the somewhat slippery idea of a generator function then you won't get through the front door here. In short, a book like this starts off by looking at a meta-description of the things that are introduced in beginning books on combinatorial analysis. The exciting thing about this field is that once one starts working with sufficiently advanced symbolism (and concepts) then there are ample moments of "Oh..ooo..this is just that, and that looks like it's really the same as that..." Happy times.