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

Authors

102

  1. RB
    Robert Brignall

    University of St Andrews, United Kingdom

    4 publications · 119 citations

    4

    h-index

  2. VV
    Vincent Vatter

    University of St Andrews, United Kingdom

    4 publications · 119 citations

    4

    h-index

  3. MA
    Michael Albert

    University of Otago, New Zealand

    4 publications · 276 citations

    4

    h-index

  4. MD
    M. D. Atkinson

    University of Otago, New Zealand

    4 publications · 274 citations

    4

    h-index

  5. AV
    A. V. Vasilyev

    National Medical Research Center of Dentistry and Maxillofacial Surgery, Russia

    3 publications · 116 citations

    3

    h-index

1–5 of 102

Venues

  1. Algebra and Logic

    6 publications · 169 citations

    6

    h-index

  2. Journal of the London Mathematical Society

    3 publications · 101 citations

    3

    h-index

  3. Journal of Algebra

    3 publications · 103 citations

    3

    h-index

  4. The Electronic Journal of Combinatorics

    3 publications · 127 citations

    3

    h-index

  5. Discrete Mathematics & Theoretical Computer Science

    DMTCS · 2 publications · 54 citations

    2

    h-index

1–5