Miklos Bona

Combinatorics of Permutations (eBook, PDF)

• Format: PDF

Produktbeschreibung

The new edition of this award-winning, graduate textbook is upated throughout. Including mostly enumerative combinatorics,yet there are algebraic, analytic, and topological parts as well, and many applications. The author continues to reveal the usefulness of the subject for both students and researchers.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Verlag: Taylor & Francis eBooks
• Seitenzahl: 528
• Erscheinungstermin: 9. Mai 2022
• Englisch
• ISBN-13: 9781000563801
• Artikelnr.: 63778585

Autorenporträt

Miklós Bóna 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 Bóna 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.

Inhaltsangabe

Foreward Preface to the First Edition Preface to the Second Edition Preface
to the Third Edition Acknowledgements Introduction: No Way around It. 1.In
One Line and Close: Permutations as Linear Orders 2.In One Line and
Anywhere: Permutations as Linear Orders- Inversions 3.In Many Circles:
Permutations as Products of Cycles 4.In Any Way but This: Pattern
Avoidance-the Basics 5.In This Way, but Nicely: Pattern Avoidance-Follow Up
6.Mean and Insensitive: Random Permutations 7.Permutations and the Rest:
Algebraic Combinatorics of Permutations 8.Get Them All: Algorithms and
Permutations 9.How Did We Get Here? Permutations as Genome Rearrangements
Do Not Look Just Yet: Solutions to Odd-Numbered Exercises References List
of Frequently Used Notation Index