Cluster compatibility conjecture for decorated reduced words
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.