|
" Introduction to combinatorics / "
Martin J. Erickson.
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
658224
|
| Doc. No
|
:
|
dltt
|
| Main Entry
|
:
|
Erickson, Martin J.,1963-
|
| Title & Author
|
:
|
Introduction to combinatorics /\ Martin J. Erickson.
|
| Publication Statement
|
:
|
New York :: Wiley,, c1996.
|
| Series Statement
|
:
|
Wiley-Interscience series in discrete mathematics and optimization
|
| Page. NO
|
:
|
xii, 195 p. :: ill. ;; 25 cm.
|
| ISBN
|
:
|
0471154083 (cloth : alk. paper)
|
|
|
:
|
: 9780471154082 (cloth : alk. paper)
|
| Notes
|
:
|
"A Wiley-Interscience publication."
|
| Bibliographies/Indexes
|
:
|
Includes bibliographical references (p. 187-189) and index.
|
| Contents
|
:
|
Preliminaries: Set theory, algebra, and number theory -- Existence: The pigeonhole principle -- Sequences and partial orders -- Ramsey theory -- Enumeration: The fundamental counting problem -- Recurrence relations and explicit formulas -- Permutations and tableaux -- The Pólya theory of counting -- Construction: Codes -- Designs -- Big designs -- Bibliography -- Index.
|
| Abstract
|
:
|
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.
|
| Subject
|
:
|
Combinatorial analysis.
|
| LC Classification
|
:
|
QA164.E74 1996
|
| |