Miklos Bona – författare

A CHOICE "Outstanding Academic Title," the first edition of this bestseller was lauded for its detailed yet engaging treatment of permutations. Providing more than enough material for a one-semester course, Combinatorics of Permutations, third edition continues to clearly show the usefulness of this subject for both students and researchers.

The research in combinatorics of permutations has advanced rapidly since this book was published in a first edition. Now the third edition offers not only updated results, it remains the leading textbook for a course on the topic.

Coverage is mostly enumerative, but there are algebraic, analytic, and topological parts as well, and applications.

Since the publication of the second edition, there is tremendous progress in pattern avoidance (Chapters 4 and 5). There is also significant progress in the analytic combinatorics of permutations, which will be incorporated.

•A completely new technique from extremal combinatorics disproved a long-standing conjecture, and this is presented in Chapter 4.

•The area of universal permutations has undergone a lot of very recent progress, and that has been noticed outside the academic community as well. This also influenced the revision of Chapter 5.

•New results in stack sorting are added to Chapter 8.

•Chapter 9 applications to biology has been revised.

The author’s other works include Introduction to Enumerative and Analytic Combinatorics, second edition (CHOICE "Outstanding Academic Title") and Handbook of Enumerative Combinatorics, published by CRC Press. The author also serves as Series Editor for CRC’s Discrete Mathematics and Its Applications.

A CHOICE "Outstanding Academic Title," the first edition of this bestseller was lauded for its detailed yet engaging treatment of permutations. Providing more than enough material for a one-semester course, Combinatorics of Permutations, third edition continues to clearly show the usefulness of this subject for both students and researchers.

The research in combinatorics of permutations has advanced rapidly since this book was published in a first edition. Now the third edition offers not only updated results, it remains the leading textbook for a course on the topic.

Coverage is mostly enumerative, but there are algebraic, analytic, and topological parts as well, and applications.

Since the publication of the second edition, there is tremendous progress in pattern avoidance (Chapters 4 and 5). There is also significant progress in the analytic combinatorics of permutations, which will be incorporated.

•A completely new technique from extremal combinatorics disproved a long-standing conjecture, and this is presented in Chapter 4.

•The area of universal permutations has undergone a lot of very recent progress, and that has been noticed outside the academic community as well. This also influenced the revision of Chapter 5.

•New results in stack sorting are added to Chapter 8.

•Chapter 9 applications to biology has been revised.

The author’s other works include Introduction to Enumerative and Analytic Combinatorics, second edition (CHOICE "Outstanding Academic Title") and Handbook of Enumerative Combinatorics, published by CRC Press. The author also serves as Series Editor for CRC’s Discrete Mathematics and Its Applications.

This award-winning textbook targets the gap between introductory texts in discrete mathematics and advanced graduate texts in enumerative combinatorics. The author’s goal is to make combinatorics more accessible to encourage student interest and to expand the number of students studying this rapidly expanding field.

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.

Updates to the Third Edition include:

Numerous exercises contain material not discussed in the text allowing instructors to extend the time they spend on a given topic. A chapter on analytic combinatorics and sections on advanced applications of generating functions, demonstrating powerful techniques that do not require the residue theorem or complex integration, and extending coverage of the given topics are highlights of the presentation.

The second edition was recognized as an Outstanding Academic Title of the Year by Choice Magazine, published by the American Library Association.

This award-winning textbook targets the gap between introductory texts in discrete mathematics and advanced graduate texts in enumerative combinatorics. The author’s goal is to make combinatorics more accessible to encourage student interest and to expand the number of students studying this rapidly expanding field.

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.

Updates to the Third Edition include:

Numerous exercises contain material not discussed in the text allowing instructors to extend the time they spend on a given topic. A chapter on analytic combinatorics and sections on advanced applications of generating functions, demonstrating powerful techniques that do not require the residue theorem or complex integration, and extending coverage of the given topics are highlights of the presentation.

The second edition was recognized as an Outstanding Academic Title of the Year by Choice Magazine, published by the American Library Association.