Enumeration Of Pattern-avoiding Permutations

Enumeration of Pattern-Avoiding Permutations is a mathematical framework within enumerative combinatorics that systematically determines the number of permutations of a given length that do not contain specified subsequences ordered in a prescribed pattern.

82

Publications

2.2K

Citations

97

Authors

81

Institutions

Publications per year

2017–2026

5

Authors

97

  1. TM
    Toufik Mansour

    University of Haifa, Israel

    15 publications · 353 citations

    14

    h-index

  2. MB
    Miklós Bóna

    University of Florida, United States

    5 publications · 152 citations

    5

    h-index

  3. MD
    M. D. Atkinson

    University of Otago, New Zealand

    4 publications · 52 citations

    4

    h-index

  4. SK
    Sergey Kitaev

    University Ucinf, Chile

    4 publications · 83 citations

    4

    h-index

  5. SE
    Sergi Elizalde

    Dartmouth College, United States

    4 publications · 138 citations

    4

    h-index

1–5 of 97

Venues

  1. The Electronic Journal of Combinatorics

    22 publications · 590 citations

    15

    h-index

  2. Advances in Applied Mathematics

    7 publications · 265 citations

    7

    h-index

  3. Discrete Mathematics & Theoretical Computer Science

    DMTCS · 6 publications · 121 citations

    6

    h-index

  4. arXiv (Cornell University)

    Repository · 6 publications · 91 citations

    6

    h-index

  5. Journal of Combinatorial Theory Series A

    5 publications · 187 citations

    5

    h-index

1–5