Wilf Equivalence

Wilf Equivalence is an equivalence relation on permutation classes defined by the property that two sets of forbidden patterns are considered equivalent if they yield the same number of avoiders of each length, thus belonging to the same Wilf class in enumerative combinatorics.

19

Publications

515

Citations

28

Authors

29

Institutions

Publications per year

2017–2026

2

Authors

28

  1. JW
    Julian West

    University of Victoria, Canada

    4 publications · 216 citations

    4

    h-index

  2. TM
    Toufik Mansour

    University of Haifa, Israel

    3 publications · 34 citations

    3

    h-index

  3. JB
    Jeffrey B. Remmel

    University of California San Diego, United States

    2 publications · 46 citations

    2

    h-index

  4. ES
    Einar Steingrı́msson

    University of Strathclyde, United Kingdom

    2 publications · 95 citations

    2

    h-index

  5. VJ
    Vít Jelínek

    Charles University, Czechia

    2 publications · 22 citations

    2

    h-index

1–5 of 28

Venues

  1. The Electronic Journal of Combinatorics

    9 publications · 200 citations

    9

    h-index

  2. Journal of Algebraic Combinatorics

    2 publications · 106 citations

    2

    h-index

  3. Discrete Mathematics & Theoretical Computer Science

    DMTCS · 2 publications · 26 citations

    2

    h-index

  4. Advances in Applied Mathematics

    1 publications · 93 citations

    1

    h-index

  5. Journal of Combinatorics

    JOC · 1 publications · 11 citations

    1

    h-index

1–5