Pattern Avoidance In Words

Pattern Avoidance in Words is a formal combinatorial concept in the study of permutation patterns that refers to the property of a word over a totally ordered alphabet in which no subsequence, not necessarily contiguous, exhibits an order-isomorphic occurrence of a given pattern.

18

Publications

704

Citations

29

Authors

24

Institutions

Publications per year

2017–2026

1

Authors

29

  1. TM
    Toufik Mansour

    University of Haifa, Israel

    4 publications · 109 citations

    4

    h-index

  2. VD
    Vladimir Dotsenko

    Landau Institute for Theoretical Physics, Russia

    2 publications · 25 citations

    2

    h-index

  3. JD
    James D. Currie

    University of Winnipeg, Canada

    2 publications · 79 citations

    2

    h-index

  4. VJ
    Vít Jelínek

    Charles University, Czechia

    2 publications · 22 citations

    2

    h-index

  5. SK
    Sergey Kitaev

    University Ucinf, Chile

    2 publications · 33 citations

    2

    h-index

1–5 of 29

Venues

  1. The Electronic Journal of Combinatorics

    4 publications · 84 citations

    4

    h-index

  2. arXiv (Cornell University)

    Repository · 3 publications · 40 citations

    3

    h-index

  3. Theoretical Computer Science

    2 publications · 84 citations

    2

    h-index

  4. International Journal of Foundations of Computer Science

    IJFCS · 1 publications · 14 citations

    1

    h-index

  5. Rutgers University Community Repository (Rutgers University)

    Repository · 1 publications · 15 citations

    1

    h-index

1–5