Introduction to Combinatorics
 |
|
Описание:
This gradual, systematic introduction to the main concepts of combinatorics is the ideal text for advanced undergraduate and early graduate courses in this subject. Each of the book?s three sections—Existence, Enumeration, and Construction—begins with a simply stated first principle, which is then developed step by step until it leads to one of the three major achievements of combinatorics: Van der Waerden?s theorem on arithmetic progressions, Polya?s graph enumeration formula, and Leech?s24–dimensional lattice. Along the way, Professor Martin J. Erickson introduces fundamental results, discusses interconnection and problem–solving techniques, and collects and disseminates open problems that raise new and innovative questions and observations. His carefully chosen end–of–chapter exercises demonstrate the applicability of combinatorial methods to a wide variety of problems, including many drawn from the William Lowell Putnam Mathematical Competition. Many important...Похожие книги
| Recent Advances in Algorithms and Combinatorics Автор: Reed B.A. Год: 2002 |
| Notes on introductory combinatorics Автор: Polya Год: 1983 |
 | Analytic Combinatorics Автор: Philippe Flajolet, Robert Sedgewick Год: 2009 |
 | Notes on Introductory Combinatorics Автор: George Pólya Год: 1983 |
| Graph Theory and Combinatorics, 1988: Proceedings Автор: Bela Bollobas Год: 1990 |
| Young tableau, representation theory and geometry Автор: William Fulton Год: 1997 |