by Albert Nijenhuis, Herbert S. Wilf
Publisher: Academic Press Inc 1978
Number of pages: 316
The book 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.
Home page url
Download or read it online for free here:
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 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.
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.