Patterns in Permutations and Words

By S. Kitaev. Monographs in Theoretical Computer Science. An EATCS Series, 2011

486 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics

View Paper: https://www.semanticscholar.org/paper/947d86836781507c964550eea98641b868e5e2f4

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Vincent Vatter
2. Sergi Elizalde
3. Valentin F'eray

In Discrete Mathematics and Combinatorics

1. Vincent Vatter
2. Sergi Elizalde
3. Mathilde Bouvel
4. Valentin F'eray

Citations in the corpus

• Pattern avoidance in inversion sequences (2015, unknown): “, [5] and the references contained therein.”
• Permutation classes (2014, background): “Several overviews of the field have been published, including Kitaev’s 494 page compendium Patterns in Permutations and Words [112], one chapter in Bóna’s undergraduate textbook A Walk Through Combinatorics [54] and several in his monograph Combinatorics of Permutations [50], and Steingŕımsson’s sur”
• A survey of consecutive patterns in permutations (2015, background): “non-consecutive) patterns, for which we refer the reader to the surveys [65] and [47].”
• The Brownian limit of separable permutations (2016, background): “s of permutations have been intensively studied for their combinatorial and algorithmic properties over the last 50 years. An account of the past and current research on these classes can be found in [9, 24, 37]. Finding the enumeration of specific classes, defined by the avoidance of a small number o”