Apress

Patterns in Permutations and Words

By Sergey Kitaev

Patterns in Permutations and Words Cover Image

There has been much interest recently in the subject of patterns in permutations and words, a new branch of combinatorics with its roots in the works of Rotem, Rogers and Knuth. This comprehensive reference volume collects the main results in the field.

Full Description

  • ISBN13: 978-3-6421-7332-5
  • 518 Pages
  • User Level: Science
  • Publication Date: August 30, 2011
  • Available eBook Formats: PDF
  • eBook Price: $159.00
Buy eBook Buy Print Book Add to Wishlist
Full Description
There has been considerable interest recently in the subject of patterns in permutations and words, a new branch of combinatorics with its roots in the works of Rotem, Rogers, and Knuth in the 1970s. Consideration of the patterns in question has been extremely interesting from the combinatorial point of view, and it has proved to be a useful language in a variety of seemingly unrelated problems, including the theory of Kazhdan—Lusztig polynomials, singularities of Schubert varieties, interval orders, Chebyshev polynomials, models in statistical mechanics, and various sorting algorithms, including sorting stacks and sortable permutations.The author collects the main results in the field in this up-to-date, comprehensive reference volume. He highlights significant achievements in the area, and points to research directions and open problems. The book will be of interest to researchers and graduate students in theoretical computer science and mathematics, in particular those working in algebraic combinatorics and combinatorics on words. It will also be of interest to specialists in other branches of mathematics, theoretical physics, and computational biology.The author collects the main results in the field in this up-to-date, comprehensive reference volume. He highlights significant achievements in the area, and points to research directions and open problems. The book will be of interest to researchers and graduate students in theoretical computer science and mathematics, in particular those working in algebraic combinatorics and combinatorics on words. It will also be of interest to specialists in other branches of mathematics, theoretical physics, and computational biology.
Table of Contents

Table of Contents

  1. Chap. 1, What Is a Pattern in a Permutation or a Word?.
  2. Chap. 2, Why Such patterns? A Few Motivation Points.
  3. Chap. 3, More Motivation Points.
  4. Chap. 4, Bijections Between 321
  5. and 132
  6. Avoiding Permutations.
  7. Chap. 5, Consecutive Patterns.
  8. Chap. 6, Classical Patterns and POPs.
  9. Chap. 7, VPs, BVPs and BPs.
  10. Chap. 8, Miscellaneous on Patterns in Permutations and Words.
  11. Chap. 9, Extending Research on Patterns in Permutations and Words to Other Domains.
  12. App. A, Useful Notions and Facts.
  13. App. B, Some Algebraic Background.
  14. Bibliography.
  15. Index.
Errata

If you think that you've found an error in this book, please let us know about it. You will find any confirmed erratum below, so you can check if your concern has already been addressed.

* Required Fields

No errata are currently published