Patterns in Permutations and Words [electronic resource] /
Kitaev, Sergey.author.
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.
Description based upon print version of record.
Includes bibliographical references and index.
Chap. 1, What Is a Pattern in a Permutation or a Word? -- Chap. 2, Why Such patterns? A Few Motivation Points -- Chap. 3, More Motivation Points -- Chap. 4, Bijections Between 321- and 132-Avoiding Permutations -- Chap. 5, Consecutive Patterns -- Chap. 6, Classical Patterns and POPs -- Chap. 7, VPs, BVPs and BPs -- Chap. 8, Miscellaneous on Patterns in Permutations and Words -- Chap. 9, Extending Research on Patterns in Permutations and Words to Other Domains -- App. A, Useful Notions and Facts -- App. B, Some Algebraic Background -- Bibliography -- Index.
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.
Computers.
Combinatorics.
Computer science—Mathematics.
Algebra.
Bioinformatics.
Theory of Computation.
Combinatorics.
Mathematics of Computing.
Algebra.
Computational Biology/Bioinformatics.
Monographs in Theoretical Computer Science. An EATCS Series