Decomposition Of Permutations
Decomposition of Permutations is a theoretical framework in combinatorics that systematically breaks down permutations into irreducible components or canonical structures, distinguished by their adherence to specific pattern-avoiding or block-separable properties.
54
Publications
2K
Citations
88
Authors
59
Institutions
Publications per year
2017–2026
7
Parents
54
1–5 of 54
88
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 88
59

Hungarian Academy of Sciences
Budapest, Hungary
3 h-index
5 publications
172 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
3 publications
105 citations

Saint Mary's University
Halifax, Canada
2 h-index
2 publications
43 citations

Chinese Academy of Sciences
Beijing, China
2 h-index
2 publications
34 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
3 publications
75 citations
Institute of Information Engineering
Beijing, China
2 h-index
2 publications
34 citations
University of California, Riverside
Riverside, United States
2 h-index
2 publications
28 citations
Stanford University
Stanford, United States
2 h-index
3 publications
63 citations
1–8 of 59
3 publications · 93 citations
3
h-index
3 publications · 65 citations
3
h-index
3 publications · 150 citations
3
h-index
3 publications · 40 citations
3
h-index
3 publications · 48 citations
3
h-index
1–5