Enumerative and Asymptotic Combinatorics

Course Material Spring 2003

"I count a lot of things that there's no need to count," Cameron said. "Just because that's the way I am. But I count all the things that need to be counted."

Richard Brautigan, The Hawkline Monster: A Gothic Western, Picador, London, 1976.

Course information

The lectures for this course take place on Wednesdays from 10:00 to 12:00 in Room 103, (Maths Seminar Room), Mathematics, Queen Mary, University of London, commencing on 15 January 2003. Classes are on Thursdays from 14:00 to 15:00 in Room 513. (Note that there are several changes from the advertised times and places!)

The updated Grey Book entry for the course includes the syllabus and the recommended texts. Further sources of information will be listed on this page in due course.

Examination information is to be found here, and a sample examination paper (with the same rubric as the real paper) is here, with solutions here.

Lecture notes

  1. Introduction
  2. Subsets, partitions, permutations
  3. Recurrence relations
  4. q-analogues
  5. Group actions and cycle index
  6. Posets and Möbius inversion
  7. Species
  8. Stirling and Lagrange
  9. Bernoulli numbers; Euler-Maclaurin sum formula
  10. Theorems of Hayman, Meir & Moon, and Bender



Peter J. Cameron
9 May 2003