Combinatorics of Permutations
eBook - ePub

Combinatorics of Permutations

  1. 508 pages
  2. English
  3. ePUB (mobile friendly)
  4. Available on iOS & Android
eBook - ePub

Combinatorics of Permutations

About this book

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.

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Combinatorics of Permutations by Miklos Bona in PDF and/or ePUB format, as well as other popular books in Computer Science & Programming Algorithms. We have over one million books available in our catalogue for you to explore.

Table of contents

  1. Cover Page
  2. Half-Title Page
  3. Series Page
  4. Title Page
  5. Copyright Page
  6. Dedication Page
  7. Contents
  8. Foreword
  9. Preface to the First Edition
  10. Preface to the Third Edition
  11. Acknowledgments
  12. No Way around It. Introduction.
  13. 1 In One Line and Close. Permutations as Linear Orders.
  14. 2 In One Line and Anywhere. Permutations as Linear Orders. Inversions.
  15. 3 In Many Circles. Permutations as Products of Cycles.
  16. 4 In Any Way but This. Pattern Avoidance. The Basics.
  17. 5 In This Way, but Nicely. Pattern Avoidance. Follow-Up.
  18. 6 Mean and Insensitive. Random Permutations.
  19. 7 Permutations and the Rest. Algebraic Combinatorics of Permutations.
  20. 8 Get Them All. Algorithms and Permutations.
  21. 9 How Did We Get Here? Permutations as Genome Rearrangements.
  22. 10 Do Not Look Just Yet. Solutions to Odd-Numbered Exercises.
  23. References
  24. List of Frequently Used Notation
  25. Index