Patterns in permutations and words

Research output: Book/ReportBook

Abstract

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.
LanguageEnglish
Number of pages494
Publication statusPublished - 2011

Publication series

NameMonographs in Theoretical Computer Science. An EATCS Series
PublisherSpringer Verlag

Fingerprint

Combinatorics
Permutation
Branch
Combinatorics on Words
Kazhdan-Lusztig Polynomial
Schubert Varieties
Interval Order
Polynomial Model
Sorting algorithm
Computational Biology
Chebyshev Polynomials
Statistical Mechanics
Sorting
Open Problems
Computer Science
Physics
Roots
Singularity
Language

Keywords

  • algebraic combinatorics
  • combinatorics on words
  • computational biology
  • patterns

Cite this

Kitaev, S. (2011). Patterns in permutations and words. (Monographs in Theoretical Computer Science. An EATCS Series ).
Kitaev, Sergey. / Patterns in permutations and words. 2011. 494 p. (Monographs in Theoretical Computer Science. An EATCS Series ).
@book{83fe8699091741ab9dcbeec9744d68c7,
title = "Patterns in permutations and words",
abstract = "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.",
keywords = "algebraic combinatorics, combinatorics on words, computational biology, patterns",
author = "Sergey Kitaev",
year = "2011",
language = "English",
isbn = "9783642173325",
series = "Monographs in Theoretical Computer Science. An EATCS Series",
publisher = "Springer Verlag",

}

Kitaev, S 2011, Patterns in permutations and words. Monographs in Theoretical Computer Science. An EATCS Series .

Patterns in permutations and words. / Kitaev, Sergey.

2011. 494 p. (Monographs in Theoretical Computer Science. An EATCS Series ).

Research output: Book/ReportBook

TY - BOOK

T1 - Patterns in permutations and words

AU - Kitaev, Sergey

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - algebraic combinatorics

KW - combinatorics on words

KW - computational biology

KW - patterns

UR - http://www.springer.com/computer/theoretical+computer+science/book/978-3-642-17332-5

M3 - Book

SN - 9783642173325

T3 - Monographs in Theoretical Computer Science. An EATCS Series

BT - Patterns in permutations and words

ER -

Kitaev S. Patterns in permutations and words. 2011. 494 p. (Monographs in Theoretical Computer Science. An EATCS Series ).