Enumerative combinatorics, in its algebraic and analytic forms, is vital to many areas of mathematics, from model theory to statistical mechanics. This book, which stems from many years' experience of teaching, invites students into the subject and prepares them for more advanced texts. It is suitable as a class text or for individual study. The author provides proofs for many of the theorems to show the range of techniques available, and uses examples to link enumerative combinatorics to other areas of study. The main section of the book introduces the key tools of the subject (generating functions and recurrence relations), which are then used to study the most important combinatorial objects, namely subsets, partitions, and permutations of a set. Later chapters deal with more specialised topics, including permanents, SDRs, group actions and the Redfield–Pólya theory of cycle indices, Möbius inversion, the Tutte polynomial, and species.Read more
- Covers a wide variety of topics, complete with the relevant background material and numerous examples
- Discusses the use of the On-Line Encyclopedia of Integer Sequences
- Highlights links to other parts of combinatorics and wider mathematics by including topics not usually covered in enumerative combinatorics
Reviews & endorsements
'It's indeed a very good introduction to enumerative combinatorics and has all the trappings of a pedagogically sound enterprise, in the old-fashioned sense: exercises, good explanations (not too terse, but certainly not too wordy), and mathematically serious (nothing namby-pamby here). It's an excellent book.' Michael Berg, MAA ReviewsSee more reviews
'Cameron's Notes on Counting is a clever introductory book on enumerative combinatorics … Overall, the text is well-written with a friendly tone and an aesthetic organization, and each chapter contains an ample number of quality exercises. Summing Up: Recommended.' A. Misseldine, CHOICE
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: June 2017
- format: Paperback
- isbn: 9781108404952
- length: 234 pages
- dimensions: 227 x 152 x 13 mm
- weight: 0.35kg
- contains: 17 b/w illus. 140 exercises
- availability: In stock
Table of Contents
2. Formal power series
3. Subsets, partitions and permutations
4. Recurrence relations
5. The permanent
7. Group actions and cycle index
8. Mobius inversion
9. The Tutte polynomial
11. Analytic methods: a first look
12. Further topics
13. Bibliography and further directions
Find resources associated with this title
Type Name Unlocked * Format Size
This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to lecturers whose faculty status has been verified. To gain access to locked resources, lecturers should sign in to or register for a Cambridge user account.
Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other lecturers may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.
Supplementary resources are subject to copyright. Lecturers are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.
If you are having problems accessing these resources please contact firstname.lastname@example.org.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email email@example.comRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×
Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.×