The trace-forest content formula conjecture for skew tableaux of hook shape
Let and be partitions with , and suppose that is a hook. Write for the number of standard Young tableaux of skew shape , and let the content of a cell be . Trace-forest content formula conjecture. The scheme based on the trace forest of jeu de taquin always gives a formula for in terms of the contents of the cells of . The conjecture would extend the paper's bijective character-evaluation method from the displayed examples to every hook ; although the corresponding character evaluations are known algebraically, the source notes that no combinatorial proof is known.
References
Primary source
Wenjie Fang, “Bijective proofs of character evaluations using trace forest of the jeu de taquin”, arXiv:1403.5697 (2014).
Progress summary
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.