Books on Combinatorics
A Combinatorial Introduction to Topology
 
Michael Henle
Dover Publications  Mar 14 1994
Description

Excellent text for upper-level undergraduate and graduate students shows how geometric and algebraic ideas met and grew together into an important branch of mathematics. Lucid coverage of vector fields, surfaces, homology of complexes, much more. Some knowledge of differential equations and multivariate calculus required. Many problems and exercises (some solutions) integrated into the text. 1979 edition. Bibliography.

A Course in Combinatorics
 
J. H. van Lint, R. M. Wilson
Cambridge University Press  January 29, 1993
Description

This major textbook, a product of many years’ teaching, will appeal to all teachers of combinatorics who appreciate the breadth and depth of the subject. The authors exploit the fact that combinatorics requires comparatively little technical background to provide not only a standard introduction but also a view of some contemporary problems. All of the 36 chapters are in bite-size portions; they cover a given topic in reasonable depth and are supplemented by exercises, some with solutions, and references. To avoid an ad hoc appearance, the authors have concentrated on the central themes of designs, graphs and codes.

A Course in Enumeration
 
Martin Aigner
Springer-Verlag Berlin Heidelberg  2007
Description

Combinatorial enumeration is a readily accessible subject full of easily stated, but sometimes tantalizingly difficult problems. This book leads the reader in a leisurely way from the basic notions to a variety of topics, ranging from algebra to statistical physics. Its aim is to introduce the student to anbsp;fascinating field, and to be a source of information for the professional mathematician who wants to learn more about the subject. The book is organized in three parts: Basics, Methods, and Topics. There are 666 exercises, and as a special feature every chapter ends with a highlight, discussing a particularly beautiful or famous result.

A Path to Combinatorics for Undergraduates: Counting Strategies
 
Titu Andreescu and Titu Andreescu
Birkhäuser Boston  November 11, 2003
Description

This unique approach to combinatorics is centered around challenging examples, fully-worked solutions, and hundreds of problems---many from Olympiads and other competitions, and many original to the authors. Each chapter highlights a particular aspect of the subject and casts combinatorial concepts in the guise of questions, illustrations, and exercises that are designed to encourage creativity, improve problem-solving techniques, and widen the reader's mathematical horizons.

A Walk Through Combinatorics
 
Miklos Bona,
World Scientific Publishing Company  June 15, 2002
Description

A=B
 
Marko Petkovsek, Herbert Wilf and Doron Zeilberger
 
Description

"A=B" is about identities in general, and hypergeometric identities in particular, with emphasis on computer methods of discovery and proof. The book describes a number of algorithms for doing these tasks, and we intend to maintain the latest versions of the programs that carry out these algorithms on this page. So be sure to consult this page from time to time, and help yourself to the latest versions of the programs.

Additive Combinatorics
 
Terrence Tao, Van Vu
AMS  September 2006
Description

Additive combinatorics is the theory of counting additive structures in sets. This theory has seen exciting developments and dramatic changes in direction in recent years thanks to its connections with areas such as number theory, ergodic theory and graph theory. This graduate level textbook will allow students and researchers easy entry into this fascinating field. Here, for the first time, the authors bring together in a self-contained and systematic manner the many different tools and ideas that are used in the modern theory, presenting them in an accessible, coherent, and intuitively clear manner, and providing immediate applications to problems in additive combinatorics. The power of these tools is well demonstrated in the presentation of recent advances such as Szemerédi's theorem on arithmetic progressions, the Kakeya conjecture and Erdos distance problems, and the developing field of sum-product estimates. The text is supplemented by a large number of exercises and new results. ? Comprehensive graduate level textbook for a highly active current area of research ? The authors bring together for the first time the many different tools and ideas that are used in the modern theory of additive combinatorics ? The text is supplemented with a large number of exercises

Advanced Combinatorics
 
Louis Comtet
Springer  January 1, 2001
Description


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号