Classical Permutation Patterns

Classical Permutation Patterns is a formal framework in combinatorics that defines a permutation as containing a classical pattern if the permutation exhibits a subsequence order-isomorphic to the pattern, distinguished by the requirement that the subsequence preserves the relative order of elements without adjacency constraints.

9

Publications

244

Citations

14

Authors

12

Institutions

Publications per year

2017–2026

2

Authors

14

  1. DB
    David Bevan

    University Ucinf, Chile

    2 publications · 28 citations

    2

    h-index

  2. HP
    Hung P. Hoang

    ETH Zurich, Switzerland

    1 publications · 18 citations

    1

    h-index

  3. TM
    Torsten Mütze

    ETH Zurich, Switzerland

    1 publications · 18 citations

    1

    h-index

  4. PB
    Petter Brändén

    KTH Royal Institute of Technology, Sweden

    1 publications · 114 citations

    1

    h-index

  5. AC
    Anders Claesson

    Reykjavík University, Iceland

    1 publications · 114 citations

    1

    h-index

1–5 of 14

Venues

  1. The Electronic Journal of Combinatorics

    3 publications · 141 citations

    3

    h-index

  2. Journal of Combinatorial Theory Series A

    1 publications · 17 citations

    1

    h-index

  3. Discrete Mathematics & Theoretical Computer Science

    DMTCS · 1 publications · 28 citations

    1

    h-index

  4. Warwick Research Archive Portal (University of Warwick)

    Repository · 1 publications · 18 citations

    1

    h-index

  5. Open Research Online (The Open University)

    Repository · 1 publications · 15 citations

    1

    h-index

1–5