Cluster compatibility conjecture for decorated reduced words
Cluster compatibility conjecture for decorated reduced words
Let be the reductive group with Weyl group , let be its maximal unipotent subgroup, and let be the longest element of . For a decorated reduced word of , let be the associated set of irreducible polynomials on .
Cluster compatibility conjecture. For any decorated reduced word for , the set is a cluster for mutation-equivalent to an initial cluster attached to any reduced word for .
This conjecture proposes that the toric coordinates arising from decorated reduced words fit into the existing cluster structure on the maximal unipotent subgroup. Its resolution is not given in the source.
Sources & referencesView supporting material
Primary source
Arkady Berenstein and Yanpeng Li, “Geometric Multiplicities”, arXiv:1908.11581 (2019).
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
Sign in to submit a solution.
No solutions have been posted yet.