Algebraic and Geometric Methods in Enumerative Combinatorics
by Federico Ardila
Publisher: arXiv 2014
Number of pages: 143
The guiding principle was to focus on algebraic and geometric techniques that are useful towards the solution of enumerative problems. The main goal of this survey is to state clearly and concisely some of the most useful tools in algebraic and geometric enumeration, and to give many examples that quickly and concretely illustrate how to put these tools to use.
Home page url
Download or read it online for free here:
by David Guichard - Whitman College
The book covers the classic parts of Combinatorics and graph theory, with some recent progress in the area. Contents: Fundamentals; Inclusion-Exclusion; Generating Functions; Systems of Distinct Representatives; Graph Theory; Polya-Redfield Counting.
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.
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 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.