Enumerative Combinatorics: Volume 1
by Richard P. Stanley
Publisher: MIT 2011
Number of pages: 725
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.
Home page url
Download or read it online for free here:
by Kenneth P. Bogart - Dartmouth College
This is an introduction to combinatorial mathematics, also known as combinatorics. The book focuses especially but not exclusively on the part of combinatorics that mathematicians refer to as 'counting'. The book consists almost entirely of problems.
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 Dainis Zeps - Latvian University
Contents: Permutations; Combinatorial maps; The correspondence between combinatorial maps and graphs on surfaces; Map's mirror reflection and dual map; Multiplication of combinatorial maps; Normalized combinatorial maps; Geometrical interpretation...
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.