Simple Permutations
Simple Permutation is a permutation that maps every nontrivial contiguous subsequence to a noncontiguous subsequence, thereby containing no nontrivial intervals that are preserved under the permutation.
61
Publications
3K
Citations
102
Authors
69
Institutions
Publications per year
2017–2026
8
Variants
Simple Permutation
Parents
61
Simple permutations and pattern restricted permutations
Michael Albert, M. D. Atkinson · Discrete Mathematics · 2005 · 170 citations
1–5 of 61
102
4
h-index
4
h-index
4
h-index
4
h-index
National Medical Research Center of Dentistry and Maxillofacial Surgery, Russia
3 publications · 116 citations
3
h-index
1–5 of 102
69

The University of Western Australia
Perth, Australia
5 h-index
10 publications
285 citations

University of St Andrews
St Andrews, United Kingdom
5 h-index
12 publications
454 citations

University of Otago
Dunedin, New Zealand
4 h-index
7 publications
537 citations
Queen Mary University of London
London, United Kingdom
2 h-index
2 publications
73 citations
California Institute of Technology
Pasadena, United States
2 h-index
2 publications
89 citations

Hungarian Academy of Sciences
Budapest, Hungary
2 h-index
4 publications
108 citations

Eötvös Loránd University
Budapest, Hungary
1 h-index
3 publications
90 citations
Harvard University
Cambridge, United States
1 h-index
1 publications
23 citations
1–8 of 69
6 publications · 169 citations
6
h-index
3 publications · 101 citations
3
h-index
3 publications · 103 citations
3
h-index
3 publications · 127 citations
3
h-index
DMTCS · 2 publications · 54 citations
2
h-index
1–5