Stable first-homology representation conjecture for complete graph configuration spaces
Statement
Let be the complete graph on vertices, let denote the ordered configuration space of particles on , and let act by permuting the vertices. Write for the irreducible -representation indexed by the partition .
Stable first-homology representation conjecture. For , there is an isomorphism of -representations
The conjecture is motivated by computed homology representations for configuration spaces of one, two, and three particles on complete graphs. It predicts a uniform description of first homology for every particle number , beyond the cases accessible in the reported computations; no resolution is supplied 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.