My Account Log in

1 option

Combinatorics : a guided tour / David R. Mazur.

Ebook Central Academic Complete Available online

View online
Format:
Book
Author/Creator:
Mazur, David R.
Series:
MAA Textbooks
MAA textbooks
Language:
English
Subjects (All):
Combinatorial analysis.
Physical Description:
1 online resource (410 p.)
Edition:
1st ed.
Place of Publication:
Washington, D.C. : Mathematical Association of America, c2010.
Language Note:
English
Summary:
Combinatorics is mathematics of enumeration, existence, construction, and optimization questions concerning finite sets. This text focuses on the first three types of questions and covers basic counting and existence principles, distributions, generating functions, recurrence relations, Pólya theory, combinatorial designs, error correcting codes, partially ordered sets, and selected applications to graph theory including the enumeration of trees, the chromatic polynomial, and introductory Ramsey theory. The only prerequisites are single-variable calculus and familiarity with sets and basic proof techniques.The text emphasizes the brands of thinking that are characteristic of combinatorics: bijective and combinatorial proofs, recursive analysis, and counting problem classification. It is flexible enough to be used for undergraduate courses in combinatorics, second courses in discrete mathematics, introductory graduate courses in applied mathematics programs, as well as for independent study or reading courses. What makes this text a guided tour are the approximately 350 reading questions spread throughout its eight chapters. These questions provide checkpoints for learning and prepare the reader for the end-of-section exercises of which there are over 470. Most sections conclude with Travel Notes that add color to the material of the section via anecdotes, open problems, suggestions for further reading, and biographical information about mathematicians involved in the discoveries.
Contents:
Ch. 1 . Principles of Combinatorics
ch. 2. Distributions and Combinatorial Proofs
ch. 3. Algebraic Tools
ch. 4. Famous Number Families
ch. 5. Counting Under Equivalence
ch. 6. Combinatorics on Graphs
ch. 7. Designs and Codes
ch. 8. Partially Ordered Sets.
Notes:
Description based upon print version of record.
Includes bibliographical references (p. 365-367) and index.
Description based on publisher supplied metadata and other sources.
ISBN:
1-61444-607-5
OCLC:
929120385

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account