Permutation Posets
Permutation Posets is a mathematical construct defined as a partially ordered set whose elements are permutations ordered by pattern containment, where one permutation is considered less than or equal to another if it occurs as a pattern within it.
15
Publications
456
Citations
22
Authors
22
Institutions
Publications per year
2017–2026
0
15
1–5 of 15
22
3
h-index
Massachusetts Institute of Technology, United States
3 publications · 202 citations
3
h-index
1
h-index
1
h-index
1
h-index
1–5 of 22
22
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
3 publications
202 citations
University of Florence
Florence, Italy
2 h-index
3 publications
43 citations

University Ucinf
Santiago, Chile
2 h-index
2 publications
33 citations

DePaul University
Chicago, United States
1 h-index
1 publications
21 citations

Shanghai Jiao Tong University
Shanghai, China
1 h-index
1 publications
11 citations
Bucknell University
Lewisburg, United States
1 h-index
1 publications
19 citations

Université de Reims Champagne-Ardenne
Reims, France
1 h-index
1 publications
12 citations

National Taiwan University
Taipei, Taiwan
1 h-index
1 publications
11 citations
1–8 of 22
2 publications · 25 citations
2
h-index
2 publications · 158 citations
2
h-index
JOC · 1 publications · 21 citations
1
h-index
1 publications · 15 citations
1
h-index
Repository · 1 publications · 10 citations
1
h-index
1–5