Alternating Eulerian–Catalan identity for odd n

About 1 year old · traced to

Let nn be odd. Write vDash[n] vDash[n] for compositions of [n][n], let phiphi range over odd compositions, let muell(phi)+1mu_{ell(phi)+1} denote the relevant Catalan-number coefficient, and let E(n,k)E(n,k) be the number of permutations of nn with kk descents.

Alternating Eulerian–Catalan identity.

∑ϕ⊨[n]ϕ is odd2n−ℓ(ϕ)μℓ(ϕ)+1=∑0≤k≤n−1(−1)kE(n,k).\sum_{\phi\vDash[n] \atop \phi\text{ is odd}}2^{n-\ell(\phi)}\mu_{\ell(\phi)+1}=\sum_{0\leq k\leq n-1}(-1)^kE(n,k).

This identity is reported as an unproved relation between Catalan numbers and Eulerian numbers and is described as irrelevant to the main result of the section.

References

Primary source

Farid Aliniaeifard and Shu Xiao Li, “The peak algebra in noncommuting variables”, arXiv:2506.12868 (2025).

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.