Little's conjecture on dual Edelman–Greene equivalence
Let be the set of all reduced words of permutations. Two reduced words are dual -equivalent when their recording tableaux under Edelman–Greene insertion agree, that is, . Little's conjecture. Two reduced words are dual -equivalent if and only if they are connected by forward and backward Little moves. This conjecture characterizes dual Edelman–Greene equivalence through the combinatorics of Little moves.
References
Status
- Solved: Zachary Hamaker and Benjamin Young. Relating Edelman–Greene insertion to the Little map (arXiv, 2013) https://arxiv.org/abs/1210.7119
Source: Thomas Lam, “Stanley symmetric functions and Peterson algebras”, arXiv:1007.2871 (2010).
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.