Combinatorics of Permutations
Taylor & Francis Inc (Verlag)
978-1-4398-5051-0 (ISBN)
- Titel erscheint in neuer Auflage
- Artikel merken
Expanded ChaptersMuch of the book has been significantly revised and extended. This edition includes a new section on alternating permutations and new material on multivariate applications of the exponential formula. It also discusses several important results in pattern avoidance as well as the concept of asymptotically normal distributions.
New ChapterAn entirely new chapter focuses on three sorting algorithms from molecular biology. This emerging area of combinatorics is known for its easily stated and extremely difficult problems, which sometimes can be solved using deep techniques from seemingly remote branches of mathematics.
Additional Exercises and ProblemsAll chapters in the second edition have more exercises and problems. Exercises are marked according to level of difficulty and many of the problems encompass results from the last eight years.
Miklós Bóna is a professor of mathematics at the University of Florida, where he is a member of the Academy of Distinguished Teaching Scholars. Dr. Bóna is an editor-in-chief of the Electronic Journal of Combinatorics. He has authored over 50 research articles and three combinatorics textbooks and has guided the research efforts of numerous undergraduate and graduate students in combinatorics. He earned a Ph.D. in mathematics from MIT.
In One Line and Close. Permutations as Linear Orders. In One Line and Anywhere. Permutations as Linear Orders. Inversions. In Many Circles. Permutations as Products of Cycles. In Any Way but This. Pattern Avoidance. The Basics. In This Way but Nicely. Pattern Avoidance. Follow-Up. Mean and Insensitive. Random Permutations. Permutations versus Everything Else. Algebraic Combinatorics of Permutations. Get Them All. Algorithms and Permutations. How Did We Get Here? Permutations as Genome Rearrangements. Solutions to Odd-Numbered Exercises. References. List of Frequently Used Notation. Index.
| Erscheint lt. Verlag | 18.7.2012 |
|---|---|
| Reihe/Serie | Discrete Mathematics and Its Applications |
| Zusatzinfo | 93 Illustrations, black and white |
| Verlagsort | Washington |
| Sprache | englisch |
| Maße | 156 x 234 mm |
| Gewicht | 816 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Graphentheorie | |
| ISBN-10 | 1-4398-5051-8 / 1439850518 |
| ISBN-13 | 978-1-4398-5051-0 / 9781439850510 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
