Combinatorial Theory (Classics in Mathematics) [Paperback]

Martin Aigner (Author)

Book Description

Series: Classics in Mathematics | Publication Date: February 25, 1997

This book offers a well-organized, easy-to-follow introduction to combinatorial theory, with examples, notes and exercises. ". . . a very good introduction to combinatorics. This book can warmly be recommended first of all to students interested in combinatorics." Publicationes Mathematicae Debrecen

Editorial Reviews

Review

From the reviews: "This book presents a very good introduction to combinatorics. It covers most aspects of enumeration and order theory,... It is divided into three parts. The first part presents the basic material on mappings and posets... The second part deals with enumeration ... Finally the third part treats of the order-theoretic aspects ... In the text examples are given and at the end of each chapter valuable notes, also very good selected exercises. They constitute an organic part of the book. This book can warmly be recommended first of all to students interested in combinatorics. A two semester course can also be based on it." Publicationes Mathematicae Debrecen

From the Back Cover

Reihentext + Combinatorial Theory From the reviews: "This book presents a very good introduction to combinatorics. It covers most aspects of enumeration and order theory,... It is divided into three parts. The first part presents the basic material on mappings and posets... The second part deals with enumeration ... Finally the third part treats of the order-theoretic aspects ... In the text examples are given and at the end of each chapter valuable notes, also very good selected exercises. They constitute an organic part of the book. This book can warmly be recommended first of all to students interested in combinatorics. A two semester course can also be based on it." (Publicationes Mathematicae Debrecen)

See all Editorial Reviews

Product Details

• Paperback: 493 pages
• Publisher: Springer (February 25, 1997)
• Language: English
• ISBN-10: 3540617876
• ISBN-13: 978-3540617877
• Product Dimensions: 9.2 x 6.1 x 1.3 inches
• Shipping Weight: 1.6 pounds (View shipping rates and policies)
• Average Customer Review: 5.0 out of 5 stars  See all reviews (1 customer review)
• Amazon Best Sellers Rank: #1,199,318 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

15 of 15 people found the following review helpful:

5.0 out of 5 stars Bringing dignity to enumerative combinatorics, January 9, 2001

By 

Jose Berlin (Seattle, WA USA) - See all my reviews

This review is from: Combinatorial Theory (Classics in Mathematics) (Paperback)

Along with statistics, combinatorics is one of the most maligned fields of mathematics. Often it is not even considered a field in its own right but merely a grab-bag of disparate tricks to be exploited by other, nobler endeavours. Where is the glory in simply counting things? This book goes a long way towards shattering these old stereotypes. By unifying enumerative combinatorics under a strong algebraic framework, Aigner finally bestows upon the humble act of counting the respect it so surely deserves.

At first, it may be somewhat trying to make sense of his presentation as he reworks familiar results in this algebraic view. Often, I was left wondering why it is necessary to go through the trouble of all these high-powered techniques just to obtain results we've already obtained through much simpler means. However, as I progressed through the chapters, it became clear that the only consistent way to tackle the truly difficult problems in enumeration was with these algebraic tools.

If you are serious about combinatorics or merely interested in what combinatorics has to offer, this volume is certainly a valuable addition to your library.