Overview

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.

Full Product Details

9781108404952

Table of Contents

Reviews

'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 Reviews

Author Information

Peter J. Cameron is a Professor in the School of Mathematics and Statistics at the University of St Andrews, Scotland. Much of his work has centred on combinatorics and, since 1992, he has been Chair of the British Combinatorial Committee. He has also worked in group and semigroup theory, model theory, and other subjects such as statistical mechanics and measurement theory. Peter J. Cameron is the recipient of the Senior Whitehead Prize of 2017 from the London Mathematical Society.

Tab Content 6

Customer Reviews

Recent Reviews

Countries Available