by Percy A. MacMahon
Publisher: Cambridge University Press 1915
Number of pages: 612
The object of this work is, in the main, to present to mathematicians an account of theorems in combinatory analysis which are of a perfectly general character, and to shew the connexion between them by as far as possible bringing them together as parts of a general doctrine. It may appeal also to others whose reading has not been very extensive.
Home page url
Download or read it online for free here:
Download link 1
Download link 2
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.
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 Klaus Truemper - Leibniz
Matroids were introduced in 1935 as an abstract generalization of graphs and matrices. Matroid decomposition covers the area of the theory dealing with decomposition and composition of matroids. The exposition is clear and simple.
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.