The joint Destop-Desbot Wilf-equivalence conjecture for 3142, 3241, and 4132

From papers

For a permutation τ\tau, let Destop(τ)\operatorname{Destop}(\tau) and Desbot(τ)\operatorname{Desbot}(\tau) denote its descent top and descent bottom sets. Patterns are (Destop,Desbot)(\operatorname{Destop},\operatorname{Desbot})-Wilf equivalent when their avoidance classes have the same joint distribution of these two statistics for every permutation length. The joint Destop-Desbot conjecture. The patterns 31423142, 32413241, and 41324132 are (Destop,Desbot)(\operatorname{Destop},\operatorname{Desbot})-Wilf equivalent. The source says this conjecture, together with the preceding classification conjectures, would identify the unique non-singleton joint equivalence class in S4S_4; the joint conjecture was verified computationally for avoiders of length at most 1010.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Alexander Burstein, “Distribution of sets of descent tops and descent bottoms on restricted permutations”, arXiv:2306.08065 (2025).

Solutions 0

No solutions have been posted yet.