by S. E. Payne
Publisher: University of Colorado 2003
Number of pages: 216
The course at CU-Denver for which these notes were assembled, Math 6409 (Applied Combinatorics), deals more or less entirely with enumerative combinatorics. We have tried to include some truly traditional material and some truly nontrivial material, albeit with a treatment that makes it accessible to the student. We shall derive a variety of techniques for counting, some purely combinatorial, some involving algebra in a moderately sophisticated way.
This document is no more available for free.
by Louis J. Billera, at al. - Cambridge University Press
The rich combinatorial problems arising from the study of various algebraic structures are the subject of the book. It will present the state of the art to graduate students and researchers in combinatorics as well as algebra, geometry, and topology.
by Federico Ardila - arXiv
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.
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 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.