The Möbius–Chebyshev conjecture for subwords over the poset Λ

About 21 years old · traced to

Let Λ\Lambda be the poset with elements a,b,ca,b,c and relations a<ca<c and b<cb<c, and let Λ∗\Lambda^* carry subword order. For words u≤wu\leq w in this poset, write μ(u,w)\mu(u,w) for the Möbius function of the resulting poset. Let Tn(x)T_n(x) be the unique polynomial satisfying

Tn(cos⁡θ)=cos⁡(nθ).T_n(\cos\theta)=\cos(n\theta).

Möbius–Chebyshev conjecture. For all integers i≤ji\leq j, μ(ai,cj)\mu(a^i,c^j) is the coefficient of xj−ix^{j-i} in Ti+j(x)T_{i+j}(x).

Numerical evidence suggests a connection between the Möbius function of Λ∗\Lambda^* and the Chebyshev polynomials of the first kind; the general Möbius function for subwords over Λ\Lambda remains to be determined.

References

Primary source

Bruce Sagan and Vincent Vatter, “The Möbius function of the composition poset”, arXiv:math/0507485 (2005).

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.