Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
About this product
Product Identifiers
PublisherCambridge University Press
ISBN-101108476546
ISBN-139781108476546
eBay Product ID (ePID)26050387860
Product Key Features
Number of Pages400 Pages
LanguageEnglish
Publication NameInvitation to Combinatorics
SubjectGeneral, Discrete Mathematics
Publication Year2021
TypeTextbook
AuthorShahriar Shahriari
Subject AreaMathematics
SeriesCambridge Mathematical Textbooks Ser.
FormatHardcover
Dimensions
Item Height1.2 in
Item Length10 in
Item Width7.6 in
Additional Product Features
Intended AudienceCollege Audience
LCCN2021-012365
Dewey Edition23
Reviews'I would certainly accept this 'invitation.' The text covers essentially all of the basic combinatorial subjects in a both gentle and intense way. The extensive problems, examples, and 'projects,' especially the collaborative projects, exemplify current pedagogical research on effective teaching methods. I would expect it to remain as a reference on many shelves.' Bruce Rothschild, University of California, Los Angeles
TitleLeadingAn
IllustratedYes
Dewey Decimal511.6
Table Of ContentPreface; Introduction; 1. Induction and Recurrence Relations; 2. The Pigeonhole Principle and Ramsey Theory; 3. Counting, Probability, Balls and Boxes; 4. Permutations and Combinations; 5. Binomial and Multinomial Coefficients; 6. Stirling Numbers; 7. Integer Partitions; 8. The Inclusion-Exclusion Principle; 9. Generating Functions; 10. Graph Theory; 11. Posets, Matchings, and Boolean Lattices; Appendices; Bibliography; Index.
SynopsisThis lively undergraduate combinatorics text covers all essential topics, with few prerequisites. Mini-projects, warm-up problems, and 1200+ exercises encourage active student participation. Students will get a glimpse into current research trends and open problems as well as some of the history and global origins of the subject., Active student engagement is key to this classroom-tested combinatorics text, boasting 1200+ carefully designed problems, ten mini-projects, section warm-up problems, and chapter opening problems. The author - an award-winning teacher - writes in a conversational style, keeping the reader in mind on every page. Students will stay motivated through glimpses into current research trends and open problems as well as the history and global origins of the subject. All essential topics are covered, including Ramsey theory, enumerative combinatorics including Stirling numbers, partitions of integers, the inclusion-exclusion principle, generating functions, introductory graph theory, and partially ordered sets. Some significant results are presented as sets of guided problems, leading readers to discover them on their own. More than 140 problems have complete solutions and over 250 have hints in the back, making this book ideal for self-study. Ideal for a one semester upper undergraduate course, prerequisites include the calculus sequence and familiarity with proofs.