The trace-forest content formula conjecture for skew tableaux of hook shape

Let λ\lambda and μ\mu be partitions with λn\lambda\vdash n, and suppose that μ\mu is a hook. Write fλ/μf^{\lambda/\mu} for the number of standard Young tableaux of skew shape λ/μ\lambda/\mu, and let the content of a cell ww be c(w)=column(w)row(w)c(w)=\operatorname{column}(w)-\operatorname{row}(w). Trace-forest content formula conjecture. The scheme based on the trace forest of jeu de taquin always gives a formula for fλ/μf^{\lambda/\mu} in terms of the contents of the cells of λ\lambda. The conjecture would extend the paper's bijective character-evaluation method from the displayed examples to every hook μ\mu; although the corresponding character evaluations are known algebraically, the source notes that no combinatorial proof is known.

Sources & referencesView supporting material

Primary source

Wenjie Fang, “Bijective proofs of character evaluations using trace forest of the jeu de taquin”, arXiv:1403.5697 (2014).

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.