Permutation Bases

Permutation Bases is a theoretical construct in combinatorics that identifies the minimal set of forbidden patterns defining a permutation class, distinguished by its role in characterizing hereditary properties through pattern avoidance.

38

Publications

1.3K

Citations

60

Authors

49

Institutions

Publications per year

2017–2026

3

Variants

Basis Of A Permutation Class

Authors

60

  1. TC
    Timothy C. Burness

    University of Bristol, United Kingdom

    4 publications · 205 citations

    4

    h-index

  2. ÁS
    Ákos Seress

    The Ohio State University, United States

    4 publications · 128 citations

    4

    h-index

  3. RM
    Robert M. Guralnick

    University of Southern California, United States

    2 publications · 106 citations

    2

    h-index

  4. RC
    Robert Cori

    Université de Bordeaux, France

    2 publications · 48 citations

    2

    h-index

  5. JS
    Jeffrey S. Leon

    University of Illinois Chicago, United States

    2 publications · 79 citations

    2

    h-index

1–5 of 60

Venues

  1. Designs Codes and Cryptography

    3 publications · 53 citations

    3

    h-index

  2. Journal of Combinatorial Theory Series A

    3 publications · 166 citations

    3

    h-index

  3. Mathematics of Computation

    MCOM · 2 publications · 79 citations

    2

    h-index

  4. 2

    h-index

  5. European Journal of Combinatorics

    2 publications · 40 citations

    2

    h-index

1–5