Enumeration Of Pattern-avoiding Permutations
Enumeration of Pattern-Avoiding Permutations is a mathematical framework within enumerative combinatorics that systematically determines the number of permutations of a given length that do not contain specified subsequences ordered in a prescribed pattern.
82
Publications
2.2K
Citations
97
Authors
81
Institutions
Publications per year
2017–2026
5
Parents
82
1–5 of 82
97
14
h-index
5
h-index
4
h-index
4
h-index
4
h-index
1–5 of 97
81
Massachusetts Institute of Technology
Cambridge, United States
9 h-index
10 publications
296 citations
University of Haifa
Haifa, Israel
8 h-index
10 publications
245 citations
Dartmouth College
Hanover, United States
4 h-index
5 publications
100 citations
Colgate University
Hamilton, United States
4 h-index
5 publications
97 citations

University of Otago
Dunedin, New Zealand
4 h-index
8 publications
106 citations
University of Florida
Gainesville, United States
4 h-index
4 publications
89 citations

University Ucinf
Santiago, Chile
3 h-index
3 publications
54 citations
University of Florence
Florence, Italy
3 h-index
7 publications
136 citations
1–8 of 81
22 publications · 590 citations
15
h-index
7 publications · 265 citations
7
h-index
DMTCS · 6 publications · 121 citations
6
h-index
Repository · 6 publications · 91 citations
6
h-index
5 publications · 187 citations
5
h-index
1–5