by William Chen
Publisher: Macquarie University 2012
Number of pages: 99
Contents: Uniform Distribution; The Classical Discrepancy Problem; Generalization of the Problem; Introduction to Lower Bounds; Introduction to Upper Bounds; Fourier Transform Techniques; Upper Bounds in the Classical Problem; The Disc Segment Problem; Convex Polygons; Fourier-Walsh Analysis.
Download or read it online for free here:
by Gian-Carlo Rota
In 1998, Gian-Carlo Rota gave his famous course at MIT. John N. Guidi took notes in a verbatim manner conveying the substance of the course. Topics covered included sets, relations, enumeration, order, matching, matroids, and geometric probability.
by S. E. Payne - University of Colorado
These notes deal with enumerative combinatorics. The author included some traditional material and some truly nontrivial material, albeit with a treatment that makes it accessible to the student. He derives a variety of techniques for counting.
by Richard P. Stanley - MIT
The standard guide to the topic for students and experts alike. The material in Volume 1 was chosen to cover those parts of enumerative combinatorics of greatest applicability and with the most important connections with other areas of mathematics.
by Peter J. Cameron - Queen Mary, University of London
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; etc.