Permutation Patterns

Permutation Patterns is a subfield of combinatorics that studies permutations under the partial order induced by containment and avoidance of (classical and generalized) permutation patterns, focusing on the structural, enumerative, and algorithmic properties of the resulting pattern classes.

562

Publications

26.2K

Citations

910

Authors

470

Institutions

Publications per year

2017–2026

47

Authors

910

  1. TM
    Toufik Mansour

    University of Haifa, Israel

    17 publications · 392 citations

    15

    h-index

  2. MB
    Miklós Bóna

    University of Florida, United States

    9 publications · 477 citations

    9

    h-index

  3. SK
    Sergey Kitaev

    University Ucinf, Chile

    9 publications · 156 citations

    9

    h-index

  4. PD
    Persi Diaconis

    Stanford University, United States

    7 publications · 978 citations

    7

    h-index

  5. VV
    Vincent Vatter

    University of St Andrews, United Kingdom

    6 publications · 188 citations

    6

    h-index

1–5 of 910

Venues

  1. The Electronic Journal of Combinatorics

    37 publications · 1.2K citations

    19

    h-index

  2. Journal of Combinatorial Theory Series A

    26 publications · 1.1K citations

    18

    h-index

  3. Advances in Applied Mathematics

    23 publications · 1.2K citations

    17

    h-index

  4. Discrete Mathematics

    30 publications · 1.1K citations

    17

    h-index

  5. American Mathematical Monthly

    12 publications · 1.8K citations

    12

    h-index

1–5