Syllabus
1. Problems of combinatorial enumeration.
2. Bijections.
3. Generating functions.
4. Exponential and composition formula.
5. Lagrange's inversion formula.
6. Asymptotic estimates.
Annotation
Introduction to enumerative combinatorics. Basic techniques
(ordinary and exponential generating functions, Lagrange inversion formula, bijective proofs) are explained on a number of concrete examples in which we shall count combinatorial structures of various kinds.