← All problems

Little's conjecture on dual Edelman–Greene equivalence

16 years old · traced to

Let R(∞)R(\infty) be the set of all reduced words of permutations. Two reduced words are dual EGEG-equivalent when their recording tableaux under Edelman–Greene insertion agree, that is, Q(i)=Q(i′)Q({\mathbf{i}})=Q({\mathbf{i}}'). Little's conjecture. Two reduced words are dual EGEG-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

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.