Books on Combinatorics
Combinatorics: The Rota Way
Joseph P. S. Kung, Gian-Carlo Rota, Catherine H. Yan
Cambridge University Press  February 9, 2009

Written by two of Gian-Carlo Rota's former students, this book is based on notes from his courses and on personal discussions with him. Topics include sets and valuations, partially ordered sets, distributive lattices, partitions and entropy, matching theory, free matrices, doubly stochastic matrices, Moebius functions, chains and antichains, Sperner theory, commuting equivalence relations and linear lattices, modular and geometric lattices, valuation rings, generating functions, umbral calculus, symmetric functions, Baxter algebras, unimodality of sequences, and location of zeros of polynomials. Many exercises and research problems are included, and unexplored areas of possible research are discussed. This book should be on the shelf of all students and researchers in combinatorics and related areas.

Computing And Combinatorics : 16th Annual International Conference, COCOON 2010, Proceedings / Nha Trang, Vietnam, July 19-21, 2010
My T. Thai and Sartaj Sahni
Springer  October 29, 2010

This book constitutes the proceedings of the 16th Annual International Conference on Computing and Combinatorics, held in Nha Trang, Vietnam, in July 2010.

Computing the Continuous Discretely
Matthias Beck, Sinai Robins
Springer  July 1, 2007

This textbook illuminates the field of discrete mathematics with examples, theory, and applications of the discrete volume of a polytope. The authors have weaved a unifying thread through basic yet deep ideas in discrete geometry, combinatorics, and number theory. We encounter here a friendly invitation to the field of "counting integer points in polytopes", and its various connections to elementary finite Fourier analysis, generating functions, the Frobenius coin-exchange problem, solid angles, magic squares, Dedekind sums, computational geometry, and more. With 250 exercises and open problems, the reader feels like an active participant.

Constructive Combinatorics
Dennis Stanton and Dennis White
Springer  May 15, 1986

At a basic level, one would expect that constructive combinatorics would address the question of how one constructs the fundamental objects in combinatorics

Contemporary Combinatorics
Bela Bollobas
Springer  October 31, 1997

This volume is a collection of survey papers in combinatorics that have grown out of lectures given in the workshop on Probabilistic Combinatorics at the Paul Erd?s Summer Research Center in Mathematics in Budapest. The papers, reflecting the many facets of modern-day combinatorics, will be appreciated by specialists and general mathematicians alike: assuming relatively little background, each paper gives a quick introduction to an active area, enabling the reader to learn about the fundamental results and appreciate some of the latest developments. An important feature of the articles, very much in the spirit of Erd?s, is the abundance of open problems.

Convex Polytopes
Branko Grunbaum
Springer  October 1, 2003

"The original edition [...] inspired a whole generation of grateful workers in polytope theory. Without it, it is doubtful whether many of the subsequent advances in the subject would have been made. The many seeds it sowed have since grown into healthy trees, with vigorous branches and luxuriant foliage. It is good to see it in print once again." --Peter McMullen, University College London

CRC Handbook of Combinatorial Designs
Charles J. Colbourn and Jeffrey H. Dinitz
CRC  February 21, 1996

From experimental design to cryptography, this comprehensive, easy-to-access reference contains literally all the facts you need on combinatorial designs. It includes constructions of designs, existence results, and properties of designs. Organized into six main parts, The CRC Handbook of Combinatorial Designs covers:

Cryptography Theory and Practice
Douglas R. Stinson
CRC Press  March 1995

Cryptography is an outstanding book that covers all the major areas of cryptography in a readable, mathematically precise form. Several chapters deal with especially active areas of research and give the reader a quick introduction and overview of the basic results in the area. Cryptography provides the mathematical theory that is necessary in order to understand how the various systems work. Most algorithms are presented in the form of pseudocode, together with examples and informal discussion of the underlying ideas. The book gives careful and comprehensive treatment of all the essential core areas of cryptography. Also, several chapters present recent topics that have not received thorough treatment in previous textbooks. Such topics include authentication codes, secret sharing schemes, identification schemes, and key distribution.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
This site is maintained by Bill Chen. If you have any suggestions or anything to contribute, please contact me at
津教备0272号 津ICP备06011496号