**Notes on Combinatorics**

by Peter J. Cameron

**Publisher**: Queen Mary, University of London 2007**Number of pages**: 130

**Description**:

Contents: Subsets and binomial coefficients; Selections and arrangements; Power series; Recurrence relations; Partitions and permutations; The Principle of Inclusion and Exclusion; Families of sets; Systems of distinct representatives; Latin squares; Steiner triple systems.

Download or read it online for free here:

**Download link**

(440KB, PDF)

## Similar books

**Combinatorial Algorithms**

by

**Albert Nijenhuis, Herbert S. Wilf**-

**Academic Press Inc**

This is a collection of mathematical algorithms with many new and interesting examples in this second edition. The authors tried to place in the reader's hands a kit of building blocks with which the reader can construct more elaborate structures.

(

**18814**views)

**Discrepancy Theory**

by

**William Chen**-

**Macquarie University**

Contents: Uniform Distribution; Classical Discrepancy Problem; Generalization of the Problem; Introduction to Lower Bounds; Introduction to Upper Bounds; Fourier Transform Techniques; Upper Bounds in the Classical Problem; Disc Segment Problem; etc.

(

**7862**views)

**Topics in Algebraic Combinatorics**

by

**Richard P. Stanley**-

**MIT**

Contents: Walks in graphs; Cubes and the Radon transform; Random walks; The Sperner property; Group actions on boolean algebras; Young diagrams and q-binomial coefficients; Enumeration under group action; A glimpse of Young tableaux; etc.

(

**9294**views)

**Analytic Combinatorics**

by

**Philippe Flajolet, Robert Sedgewick**-

**Cambridge University Press**

Deals with the the analysis of discrete structures, that emerged over the past years as an essential tool in the understanding of computer programs and models with applications in science. The text contains examples and exercises.

(

**17081**views)