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
Parents
19
Wilf-equivalence for singleton classes
Jörgen Backelin, Julian West, Guoce Xin · Advances in Applied Mathematics · 2006 · 93 citations
1–5 of 19
28
4
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 28
29
University of Haifa
Haifa, Israel
3 h-index
4 publications
44 citations
Charles University
Prague, Czechia
3 h-index
7 publications
79 citations

University of Victoria
Victoria, Canada
3 h-index
3 publications
195 citations
Princeton University
Princeton, United States
3 h-index
3 publications
49 citations

University of Strathclyde
Glasgow, United Kingdom
2 h-index
5 publications
105 citations

University Ucinf
Santiago, Chile
2 h-index
2 publications
72 citations
Dartmouth Hospital
Dartmouth, United Kingdom
1 h-index
2 publications
58 citations
Institut Polytechnique de Bordeaux
Bordeaux, France
1 h-index
2 publications
76 citations
1–8 of 29
9 publications · 200 citations
9
h-index
2 publications · 106 citations
2
h-index
DMTCS · 2 publications · 26 citations
2
h-index
1 publications · 93 citations
1
h-index
JOC · 1 publications · 11 citations
1
h-index
1–5