← All problems

The des-Wilf equivalences among four-letter non-classical patterns

8 years old · documented by

For a permutation pattern τ\tau, let Fndes⁡(τ;q)F_n^{\operatorname{des}}(\tau;q) denote the descent generating polynomial over permutations in Av⁡n(τ)\operatorname{Av}_n(\tau), and write τ≡des⁡ρ\tau\equiv_{\operatorname{des}}\rho when Fndes⁡(τ;q)=Fndes⁡(ρ;q)F_n^{\operatorname{des}}(\tau;q)=F_n^{\operatorname{des}}(\rho;q) for every nn. The des-Wilf equivalences conjecture. The following equivalences hold:

1243≡des⁡3412and1342≡des⁡2413.1243\equiv_{\operatorname{des}}3412\qquad\text{and}\qquad 1342\equiv_{\operatorname{des}}2413.

These conjectured equalities concern descent-preserving enumeration of permutations avoiding the displayed non-classical patterns; the paper reports supporting data but no closed forms for the relevant generating polynomials are known.

References
  1. Caden Bielawa, Robert Davis, Daniel Greeson and Qinhan Zhou, “Descents and des-Wilf Equivalence of Permutations Avoiding Certain Non-Classical Patterns”, arXiv:1706.06231 (2018).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.