Introduction to Enumeration

Written for students taking a second or third year undergraduate course in mathematics or computer science, this book is the ideal companion to a course in enumeration. Enumeration is a branch of combinatorics where the fundamental subject matter is numerous methods of pattern formation and counting. Introduction to Enumeration provides a comprehensive and practical introduction to this subject giving a clear account of fundamental results and a thorough grounding in the use of powerful techniques and tools.Two major themes run in parallel through the book,  generating functions and group theory. The former theme takes enumerative sequences and then uses analytic tools to discover how they are made up. Group theory provides a concise introduction to groups and illustrates how the theory can be used  to count the number of symmetries a particular object has. These enrich and extend basic group ideas and techniques.The authors present their material through examples that are carefully chosen to establish key results in a natural setting. The aim is to progressively build fundamental theorems and techniques. This development is interspersed with exercises that consolidate ideas and build confidence. Some exercises are linked to particular sections while others range across a complete chapter. Throughout, there is an attempt to present key enumerative ideas in a graphic way, using diagrams to make them immediately accessible. The development assumes some basic group theory, a familiarity with analytic functions and their power series expansion along with  some basic linear algebra.

From the reviews:“This work is a very basic, short introduction to combinatorial enumeration techniques. Camina (Univ. of East Anglia, UK) and Lewis (The Mathematical Association, UK) properly explain the fundamental concepts … . There are 20-25 exercises per chapter … . The numerical answers to the majority of these exercises are included at the end. … It may be useful for students who need very basic enumeration skills … . Summing Up … . Lower- and upper-division undergraduates.” (M. Bona, Choice, Vol. 49 (4), December, 2011)“This book is written as an introduction to enumeration for second or third year undergraduate students in mathematics or computer science. Its theme is counting, using finite or infinite series … . The development is interspersed with exercises, linked to particular sections, or covering a complete chapter. Solutions are provided at the end of the book.” (Andreas N. Philippou, Zentralblatt MATH, Vol. 1230, 2012)“This is an introductory text on counting and combinatorics that has good coverage … . It is aimed at a sophomore or higher level and has few prerequisites beyond power series. … There are numerous exercises, and all have brief solutions in the back. … It is unusual to see a book that combines such extensive coverage with so few prerequisites.” (Allen Stenger, The Mathematical Association of America, August, 2011)

"I have adopted your text "An introduction to enumeration" for my undergraduate combinatorics course. Overall, it is wonderful...I like how your book actually teaches something, beyond a loose tour of combinatorics that many other books offer. The ability to fluidly go back and forth between recurrences and generating functions, that sort of thing...It trades the broadest focus for specific techniques, in that way reminding me what's fun in say, an ODE course. My students actually learn something they couldn't do before, it makes them feel smart so they like the course " (Prof Dave Bayer, Barnard College, NY, USA)