**Combinatorial Algorithms**

by Albert Nijenhuis, Herbert S. Wilf

**Publisher**: Academic Press Inc 1978**ISBN/ASIN**: 0125192509**ISBN-13**: 9780125192507**Number of pages**: 316

**Description**:

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.

Download or read it online for free here:

**Download link**

(5.5MB, PDF)

## Similar books

**Topics in Algebraic Combinatorics**

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.

(

**6521**views)

**Notes on Combinatorics**

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.

(

**6560**views)

**Algebraic and Geometric Methods in Enumerative Combinatorics**

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.

(

**4685**views)

**Applied Combinatorics**

by

**Mitchel T. Keller, William T. Trotter**-

**Georgia Institute of Technology**

The purpose of the course is to give students a broad exposure to combinatorial mathematics, using applications to emphasize fundamental concepts and techniques. Our approach to the course is to show students the beauty of combinatorics.

(

**6042**views)