Eulerian descent-set distribution conjecture for marked cycles

About 17 years old · traced to

For n≥1n\geq 1, let Tn0{\mathcal T}^0_n be the class of objects defined in the paper, let D(σ)⊆{1,2,…,n−1}D(\sigma)\subseteq\{1,2,\dots,n-1\} denote the descent set of σ∈Tn0\sigma\in{\mathcal T}^0_n, let Sn{\mathcal S}_n be the symmetric group, and let An(x)A_n(x) be the nn-th Eulerian polynomial.

Eulerian descent-set distribution conjecture. For any nn and any subset D⊆{1,2,…,n−1}D\subseteq\{1,2,\dots,n-1\},

∣{σ∈Tn0 : D(σ)=D}∣=∣{π∈Sn : D(π)=D}∣.|\{\sigma\in{\mathcal T}^0_n\,:\,D(\sigma)=D\}|=|\{\pi\in{\mathcal S}_n\,:\,D(\pi)=D\}|.

In particular,

∑σ∈Tn0xdes⁡(σ)+1=An(x).\sum_{\sigma\in{\mathcal T}^0_n}x^{\operatorname{des}(\sigma)+1}=A_n(x).

The conjecture arose from experimental evidence and was checked by computer for nn up to 99; the asserted distribution beyond those computations remains open.

References

Primary source

Sergi Elizalde, “The number of permutations realized by a shift”, arXiv:0909.2274 (2009).

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.