Keyword

pattern avoidance

Description: Pattern avoidance is the study of structures that do not contain specified substructures, especially in enumerative combinatorics.

Primary topic: Advanced Combinatorial Mathematics (86%)

OpenAlex ID: keywords/pattern-avoidance

String overlaps, pattern matching, and nontransitive games

1981 · L.J Guibas, A.M Odlyzko · Journal of Combinatorial Theory Series A · 405

Combinatorics of Permutations

2022 · Miklós Bóna · Chapman & Hall/CRC eBooks · 396

Patterns in Permutations and Words

2011 · Sergey Kitaev · Monographs in theoretical computer science · 374

Generating trees and the Catalan and Schröder numbers

1995 · Julian West · Discrete Mathematics · 246

PDF

The number of baxter permutations

1978 · F.R.K Chung, R.L Graham, et al. · Journal of Combinatorial Theory Series A · 196

Combinatorics of Compositions and Words

2009 · Silvia Heubach, Toufik Mansour · Chapman & Hall/CRC eBooks · 167

Permutations with forbidden subsequences, and, stack-sortable permutations

1990 · Julian West · DSpace@MIT (Massachusetts Institute of Technology) · 147

Generalized Pattern Avoidance

2001 · Anders Claesson · European Journal of Combinatorics · 137

PDF

Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes

2006 · C. Krattenthaler · Advances in Applied Mathematics · 129

PDF

Combinatorics of Set Partitions

2012 · Toufik Mansour · Chapman & Hall/CRC eBooks · 125

On the Stanley-Wilf Conjecture for the Number of Permutations Avoiding a Given Pattern

1999 · Richard Arratia · The Electronic Journal of Combinatorics · 116

PDF

Mesh Patterns and the Expansion of Permutation Statistics as Sums of Permutation Patterns

2011 · Petter Brändén, Anders Claesson · The Electronic Journal of Combinatorics · 107

PDF

Lattice congruences, fans and Hopf algebras

2004 · Nathan Reading · Journal of Combinatorial Theory Series A · 100

PDF

Forbidden paths and cycles in ordered graphs and matrices

2006 · János Pach, Gábor Tardos · Israel Journal of Mathematics · 90

PDF

Wilf-equivalence for singleton classes

2006 · Jörgen Backelin, Julian West, et al. · Advances in Applied Mathematics · 86

PDF

Increasing and decreasing subsequences and their variants

2007 · Richard P. Stanley · Proceedings of the International Congress of Mathematicians Madrid, August 22–30, 2006 · 83

Restricted 132-Avoiding Permutations

2001 · Toufik Mansour, Alek Vainshtein · Advances in Applied Mathematics · 82

Smoothness of Schubert varieties via patterns in root subsystems

2004 · Sara Billey, Alexander Postnikov · Advances in Applied Mathematics · 81

PDF

Forbidden subsequences and Chebyshev polynomials

1999 · Timothy Chow, Julian West · Discrete Mathematics · 81

PDF

A generalization of Sauer's lemma

1995 · David Haussler, Philip M Long · Journal of Combinatorial Theory Series A · 81

The patterns of permutations

2002 · Herbert S. Wilf · Discrete Mathematics · 79

Pattern Avoidance in Set Partitions

2006 · Sagan, Bruce E. · arXiv (Cornell University) · 78

PDF

Pattern Avoidance and Rational Smoothness of Schubert Varieties

1998 · Sara C Billey · Advances in Mathematics · 67

PDF

Enumeration of words with forbidden patterns

1998 · Alexander Burstein · Scholarly Commons (University of Pennsylvania) · 67

Pattern avoidance and the Bruhat order

2006 · Bridget Eileen Tenner · Journal of Combinatorial Theory Series A · 66

PDF

Works count: 1,875

Citation count: 12,720