Classical Permutation Patterns
Classical Permutation Patterns is a formal framework in combinatorics that defines a permutation as containing a classical pattern if the permutation exhibits a subsequence order-isomorphic to the pattern, distinguished by the requirement that the subsequence preserves the relative order of elements without adjacency constraints.
9
Publications
244
Citations
14
Authors
12
Institutions
Publications per year
2017–2026
2
Parents
9
Continued fractions, statistics, and generalized patterns
Toufik Mansour · ArXiv.org · 2001 · 15 citations · Full text
1–5 of 9
14
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 14
12

The Open University
Milton Keynes, United Kingdom
2 h-index
2 publications
28 citations

University Ucinf
Santiago, Chile
2 h-index
2 publications
127 citations
Laboratoire Bordelais de Recherche en Informatique
Talence, France
1 h-index
1 publications
15 citations
Czech Academy of Sciences, Institute of Mathematics
Prague, Czechia
1 h-index
1 publications
28 citations

KTH Royal Institute of Technology
Stockholm, Sweden
1 h-index
1 publications
114 citations
ETH Zurich
Zurich, Switzerland
1 h-index
1 publications
18 citations

Massachusetts College of Liberal Arts
North Adams, United States
1 h-index
1 publications
18 citations
University of Washington
Seattle, United States
1 h-index
2 publications
34 citations
1–8 of 12
3 publications · 141 citations
3
h-index
1 publications · 17 citations
1
h-index
DMTCS · 1 publications · 28 citations
1
h-index
Repository · 1 publications · 18 citations
1
h-index
Repository · 1 publications · 15 citations
1
h-index
1–5