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

From papers

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 uwu\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 iji\leq j, μ(ai,cj)\mu(a^i,c^j) is the coefficient of xjix^{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.

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

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

Solutions 0

No solutions have been posted yet.