Introduction to Enumerative and Analytic Combinatorics (Discrete Mathematics and its Applications 2nd Revised edition)

Introduction to Enumerative and Analytic Combinatorics (Discrete Mathematics and its Applications 2nd Revised edition)

By: Miklos Bona (author)Hardback

1 - 2 weeks availability

£53.19 RRP £55.99  You save £2.80 (5%) With FREE Saver Delivery

Description

Introduction to Enumerative and Analytic Combinatorics fills the gap between introductory texts in discrete mathematics and advanced graduate texts in enumerative combinatorics. The book first deals with basic counting principles, compositions and partitions, and generating functions. It then focuses on the structure of permutations, graph enumeration, and extremal combinatorics. Lastly, the text discusses supplemental topics, including error-correcting codes, properties of sequences, and magic squares. Strengthening the analytic flavor of the book, this Second Edition: * Features a new chapter on analytic combinatorics and new sections on advanced applications of generating functions * Demonstrates powerful techniques that do not require the residue theorem or complex integration * Adds new exercises to all chapters, significantly extending coverage of the given topics Introduction to Enumerative and Analytic Combinatorics, Second Edition makes combinatorics more accessible, increasing interest in this rapidly expanding field.

Create a review

About Author

Miklos Bona received his Ph.D in mathematics from the Massachusetts Institute of Technology in 1997. Since 1999, he has taught at the University of Florida, where, in 2010, he was inducted into the Academy of Distinguished Teaching Scholars. Professor Bona has mentored numerous graduate and undergraduate students. He is the author of four books and more than 65 research articles, mostly focusing on enumerative and analytic combinatorics. His book, Combinatorics of Permutations, won a 2006 Outstanding Title Award from Choice, the journal of the American Library Association. He is also an editor-in-chief for the Electronic Journal of Combinatorics, and for two book series at CRC Press.

Contents

METHODS Basic methods When we add and when we subtract When we multiply When we divide Applications of basic counting principles The pigeonhole principle Notes Chapter review Exercises Solutions to exercises Supplementary exercises Applications of basic methods Multisets and compositions Set partitions Partitions of integers The inclusion-exclusion principle The twelvefold way Notes Chapter review Exercises Solutions to exercises Supplementary exercises Generating functions Power series Warming up: Solving recurrence relations Products of generating functions Compositions of generating functions A different type of generating functions Notes Chapter review Exercises Solutions to exercises Supplementary exercises TOPICS Counting permutations Eulerian numbers The cycle structure of permutations Cycle structure and exponential generating functions Inversions Advanced applications of generating functions to permutation enumeration Notes Chapter review Exercises Solutions to exercises Supplementary exercises Counting graphs Trees and forests Graphs and functions When the vertices are not freely labeled Graphs on colored vertices Graphs and generating functions Notes Chapter review Exercises Solutions to exercises Supplementary exercises Extremal combinatorics Extremal graph theory Hypergraphs Something is more than nothing: Existence proofs Notes Chapter review Exercises Solutions to exercises Supplementary exercises AN ADVANCED METHOD Analytic combinatorics Exponential growth rates Polynomial precision More precise asymptotics Notes Chapter review Exercises Solutions to exercises Supplementary exercises SPECIAL TOPICS Symmetric structures Designs Finite projective planes Error-correcting codes Counting symmetric structures Notes Chapter review Exercises Solutions to exercises Supplementary exercises Sequences in combinatorics Unimodality Log-concavity The real zeros property Notes Chapter review Exercises Solutions to exercises Supplementary exercises Counting magic squares and magic cubes A distribution problem Magic squares of fixed size Magic squares of fixed line sum Why magic cubes are different Notes Chapter review Exercises Solutions to exercises Supplementary exercises Appendix: The method of mathematical induction Weak induction Strong induction

Product Details

  • publication date: 15/10/2015
  • ISBN13: 9781482249095
  • Format: Hardback
  • Number Of Pages: 556
  • ID: 9781482249095
  • weight: 929
  • ISBN10: 148224909X
  • edition: 2nd Revised edition

Delivery Information

  • Saver Delivery: Yes
  • 1st Class Delivery: Yes
  • Courier Delivery: Yes
  • Store Delivery: Yes

Prices are for internet purchases only. Prices and availability in WHSmith Stores may vary significantly

Close