Combinatorics of permutations / / Miklos Bona

• Record Nr.: UNINA9910462394303321
• Autore: Bona Miklos.
• Pubbl/distr/stampa: Boca Raton, Fla : , : CRC Press, , 2012
• ISBN: 0-429-10724-2; 1-4398-5052-6
• Edizione: [2nd ed.]
• Descrizione fisica: 1 online resource (474 p.)
• Collana: Discrete mathematics and its applications
• Disciplina: 511/.64
• Soggetti: Permutations; Combinatorial analysis; Electronic books.
• Lingua di pubblicazione: Inglese
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Note generali: A Chapman and Hall book.
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: Front Cover; Dedication; Contents; Foreword; Preface to the First Edition; Preface to the Second Edition; Acknowledgments; No Way around It. Introduction; 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 Permutations9. 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
• Sommario/riassunto: Preface to the Second Edition It has been eight years since the first edition of Combinatorics of Permutations was published. All parts of the subject went through significant progress during those years. Therefore, we had to make some painful choices as to what to include in the new edition of this book. First, there is a new chapter to this edition, Chapter 9, which is devoted to sorting algorithms whose original motivation comes from molecular biology. This very young part of combinatorics is known for its easily stated and extremely difficult ; problems which sometimes can be solved using deep techniques from remote-looking parts of mathematics. We decided to discuss three sorting algorithms in detail. Second, half of the existing chapters, namely Chapters 1, 3, 4, and 6 have been significantly changed or extended. Chapter 1 has a new section on Alternating Permutations, while Chapter 3 has new material on multivariate applications of the Exponential Formula. In Chapter 4, which discusses pattern avoidance, several important results, some in the text, some in the exercises, have been improved. Chapter 6, discussing some probabilistic aspects of permutations, now covers the concept of asymptotically normal distributions. Third, all chapters have an extended Exercises section and an extended Problems Plus section. The latter often contains results from the last eight years. Exercises marked with a (+) sign are thought to be more difficult than average, while exercises marked with a (-) sign are thought to be easier. The book does not assume previous knowledge of combinatorics above the level of an introductory undergraduate course--