Books on Combinatorics
Handbook of Applied Cryptography
Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone
CRC  October 16, 1996

Cryptography, in particular public-key cryptography, has emerged in the last 20 years as an important discipline that is not only the subject of an enormous amount of research, but provides the foundation for information security in many applications. Standards are emerging to meet the demands for cryptographic protection in most areas of data communications. Public-key cryptographic techniques are now in widespread use, especially in the financial services industry, in the public sector, and by individuals for their personal privacy, such as in electronic mail. This Handbook will serve as a valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography. It is a necessary and timely guide for professionals who practice the art of cryptography. The Handbook of Applied Cryptography provides a treatment that is multifunctional:

Handbook of Combinatorics. 1
Ronald L. Graham
The MIT Press  1995

Handbook of Combinatorics.2
Martin Grötschel
MIT Press  2003

Combinatorics research, the branch of mathematics that deals with the study of discrete, usually finite, structures, covers a wide range of problems not only in mathematics but also in the biological sciences, engineering, and computer science. The Handbook of Combinatorics brings together almost every aspect of this enormous field and is destined to become a classic. Ronald L. Graham, Martin Grotschel, and Laszlo Lovasz, three of the world's leading combinatorialists, have compiled a selection of articles that cover combinatorics in graph theory, theoretical computer science, optimization, and convexity theory, plus applications in operations research, electrical engineering, statistical mechanics, chemistry, molecular biology, pure mathematics, and computer science.

Handbook of Discrete and Computational Geometry
Jacob E. Goodman and Joseph O'Rourke
CRC-Press  August 20, 1997

For the first time discrete geometry, geometric computing, and their many applications in one complete reference. The authors have answered the need for a comprehensive handbook for workers in these and related fields, and for other users of the body of results. The Handbook of Discrete and Computational Geometry brings together, for the first time, all of the major results in both these fields into one volume. Thousands of results theorems, algorithms, and tables throughout the volume definitively cover the field, while numerous applications from many different fields demonstrate practical usage. The material is presented clearly enough to assist the novice, but in enough depth to appeal to the specialist. Over 200 figures illustrate the concepts presented and provide supporting examples.

Horizons of Combinatorics
Ervin Gyori, Gyula O.H. Katona, László Lovász
Springer  November 24, 2010

Hungarian mathematics has always been known for discrete mathematics, including combinatorial number theory, set theory and recently random structures, and combinatorial geometry. The recent volume contains high level surveys on these topics with authors mostly being invited speakers for the conference "Horizons of Combinatorics" held in Balatonalmadi, Hungary in 2006. The collection gives an overview of recent trends and results in a large part of combinatorics and related topics.

Indiscrete Thoughts
Gian-Carlo Rota and Fabrizio Palombi
Birkhäuser Boston  April 13, 2006

"Indiscrete Thoughts" gives a rare glimpse into a world that has seldom been described, that of science and technology as seen through the eyes of a mathematician. The era covered by this book, 1950 to 1990, was surely one of the golden ages of science and the American university as well.

Integer Partitions
George E. Andrews and Kimmo Eriksson
Cambridge University Press  October 11, 2004

The theory of integer partitions is a subject of enduring interest as well as a major research area. It has found numerous applications, including celebrated results such as the Rogers-Ramanujan identities. The aim of this introductory textbook is to provide an accessible and wide-ranging introduction to partitions, without requiring anything more than some familiarity with polynomials and infinite series. Many exercises are included, together with some solutions and helpful hints.

Introduction to Boolean Algebras
Steven Givant, Paul Halmos
Springer  November 19, 2010

This book is an informal, although systematic presentation of lectures given by the authors on Boolean algebras, intended for advanced undergraduates and beginning graduate students. In a bold and refreshing style, this book treats Boolean algebras, develops some intriguing ideas, and provides rare insights. Exercises are generously sprinkled throughout the text for course study. This book can be considered a sequel to Paul Halmos's Lectures on Boolean Algebras, with the following changes: (1) the material in every section has been explained in more detail, and is now more accessible to undergraduates; (2) there are three times as many exercises, and the authors have now prepared a solutions manual; (3) a more careful explanation of the relationship between Boolean rings and Boolean algebras has been added; (4) thirteen chapters have been added, including chapters on topology and on continuous functions, a chapter on the extension theorem for homomorphisms, a new chapter on congruences and quotient algebras, a chapter on the lattice of ideals, and a chapter on duality theory for products.

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号