The Desbot-Wilf classification conjecture for patterns in S_4
The Desbot-Wilf classification conjecture for patterns in S_4
Let be the set of permutations of length . For a permutation , define its descent bottom set by
Two patterns are Desbot-Wilf equivalent if their avoidance classes have the same -distribution for every permutation length. The Desbot-Wilf classification conjecture. The non-singleton -Wilf equivalence classes in are
This is presented as equivalent to the preceding Destop classification by reverse complement; its general status is unresolved in the supplied text.
Sources & referencesView supporting material
Primary source
Alexander Burstein, “Distribution of sets of descent tops and descent bottoms on restricted permutations”, arXiv:2306.08065 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.