Generalized Permutation Patterns

Generalized Permutation Patterns is a combinatorial pattern class that extends classical permutation patterns by allowing certain elements to be adjacent in the pattern to be required or forbidden to be adjacent in an occurrence, thereby refining the notion of pattern containment with additional structural constraints.

20

Publications

1.1K

Citations

24

Authors

18

Institutions

Publications per year

2017–2026

0

Authors

24

  1. TM
    Toufik Mansour

    University of Haifa, Israel

    6 publications · 123 citations

    6

    h-index

  2. AC
    Anders Claesson

    Reykjavík University, Iceland

    2 publications · 64 citations

    2

    h-index

  3. ES
    Einar Steingrı́msson

    University of Strathclyde, United Kingdom

    2 publications · 324 citations

    2

    h-index

  4. AB
    Alexander Burstein

    Howard University, United States

    2 publications · 38 citations

    2

    h-index

  5. DR
    David R. Bellhouse

    Western University, Canada

    1 publications · 38 citations

    1

    h-index

1–5 of 24

Venues

  1. ArXiv.org

    Repository · 6 publications · 119 citations

    6

    h-index

  2. arXiv (Cornell University)

    Repository · 3 publications · 66 citations

    3

    h-index

  3. The Electronic Journal of Combinatorics

    2 publications · 49 citations

    2

    h-index

  4. Journal of Combinatorial Theory Series A

    2 publications · 145 citations

    2

    h-index

  5. Journal of Classification

    1 publications · 72 citations

    1

    h-index

1–5