Skip to content

Combinatorics A Guided Tour

Best in textbook rentals since 2012!

ISBN-10: 0883857626

ISBN-13: 9780883857625

Edition: 2010

Authors: David R. Mazur

List price: $68.00
Blue ribbon 30 day, 100% satisfaction guarantee!
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Customers also bought

Book details

List price: $68.00
Copyright year: 2010
Publisher: American Mathematical Society
Publication date: 12/31/2010
Binding: Hardcover
Pages: 410
Size: 7.00" wide x 10.00" long x 1.00" tall
Weight: 2.178
Language: English

David R. Mazur is Associate Professor of Mathematics at Western New England College in Springfield, Massachusetts. He was born on October 23, 1971 in Washington, D.C. He received his undergraduate degree in Mathematics from the University of Delaware in 1993, and also won the Department of Mathematical Sciences' William D. Clark prize for 'unusual ability' in the major that year. He then received two fellowships for doctoral study in the Department of Mathematical Sciences (now the Department of Applied Mathematics and Statistics) at The Johns Hopkins University. From there he received his Master's in 1996 and his Ph.D. in 1999 under the direction of Leslie A. Hall, focusing on operations…    

Preface
Before you go
Notation
Principles of Combinatorics
Typical counting questions, the product principle
Counting, overcounting, the sum principle
Functions and the bijection principle
Relations and the equivalence principle
Existence and the pigeonhole principle
Distributions and Combinatorial Proofs
Counting functions
Counting subsets and multisets
Counting set partitions
Counting integer partitions
Algebraic Tools
Inclusion-exclusion
Mathematical induction
Using generating functions, part I
Using generating functions, part II
techniques for solving recurrence relations
Solving linear recurrence relations
Famous Number Families
Binomial and multinomial coefficients
Fibonacci and Lucas numbers
Stirling numbers
Integer partition numbers
Counting Under Equivalence
Two examples
Permutation groups
Orbits and fixed point sets
Using the CFB theorem
Proving the CFB theorem
The cycle index and P�lya's theorem
Combinatorics on Graphs
Basic graph theory
Counting trees
Colouring and the chromatic polynomial
Ramsey theory
Designs and Codes
Construction methods for designs
The incidence matrix, symmetric designs
Fisher's inequality, Steiner systems
Perfect binary codes
Codes from designs, designs from codes
Partially Ordered Sets
Poset examples and vocabulary
Isomorphism and Sperner's theorem
Dilworth's theorem
Dimension
M�bius inversion, part I
M�bius inversion, part II
Bibliography
Hints and answers to selected exercises