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's 24-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 combinatorial methods are revisited several times in the course of the text--in exercises and examples as well as theorems and proofs. This repetition enables students to build confidence and reinforce their understanding of complex material.
Mathematicians, statisticians, and computer scientists profit greatly from a solid foundation in combinatorics. Introduction to Combinatorics builds that foundation in an orderly, methodical, and highly accessible manner.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
This up-to-date compendium of results in the field develops the subject matter using a trichotometric framework from existence, enumeration, and construction perspectives. The treatment is succinct, orderly, scholarly, and consists of an introduction to fundamental outcomes along with interconnections and problem solving techniques. Contains extensive examples and exercises, many from the William Lowell Putnam Mathematical Competition. Open-ended problems raise new, innovative questions and observations.About the Author:
MARTIN J. ERICKSON, PhD, is Associate Professor at Truman State University, Kirksville, Missouri. His research interests include combinatorics, graph theory, and coding theory. Professor Erickson has received numerous national awards and is the author of several previous publications.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Descrizione libro Wiley-Interscience, 1996. Hardcover. Condizione libro: New. book. Codice libro della libreria M0471154083
Descrizione libro Wiley-Interscience, 1996. Hardcover. Condizione libro: New. Codice libro della libreria P110471154083
Descrizione libro Wiley-Interscience, 1996. Hardcover. Condizione libro: Brand New. 1st edition. 195 pages. 9.75x6.50x0.75 inches. In Stock. Codice libro della libreria 0471154083