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
Notes on the Combinatorial Fundamentals of Algebraby Darij Grinberg - arXiv.org
This is a detailed survey, with rigorous and self-contained proofs, of some of the basics of elementary combinatorics and algebra, including the properties of finite sums, binomial coefficients, permutations and determinants.
(4939 views)
Algebraic and Geometric Methods in Enumerative Combinatoricsby 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.
(9472 views)
Combinatorial Maps: Tutorialby 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...
(8806 views)
New Perspectives in Algebraic Combinatoricsby 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.
(14015 views)