| 书目名称 | Patterns in Permutations and Words | | 编辑 | Sergey Kitaev | | 视频video | | | 概述 | The main results in the field are collected in this up-to-date, comprehensive reference volume.The author addresses differences in ideas and notations, highlights the main achievements, and points to | | 丛书名称 | Monographs in Theoretical Computer Science. An EATCS Series | | 图书封面 |  | | 描述 | .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 | | 出版日期 | Book 2011 | | 关键词 | algebraic combinatorics; combinatorics on words; computational biology; patterns; combinatorics | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-642-17333-2 | | isbn_softcover | 978-3-642-26987-5 | | isbn_ebook | 978-3-642-17333-2Series ISSN 1431-2654 Series E-ISSN 2193-2069 | | issn_series | 1431-2654 | | copyright | Springer-Verlag Berlin Heidelberg 2011 |
The information of publication is updating
|
|
发表于 2025-3-21 18:57:38
