The degree-2 real-root counting conjecture for rigid rank 2 modules
Statement
Assume . Let be the associated Kac–Moody algebra, let be a real root of degree , and let be the map from indecomposable modules to roots. Degree-2 counting conjecture. For every such real root , there are exactly two non-isomorphic rigid indecomposable rank modules and satisfying
Consequently, the total number of rigid indecomposable rank modules corresponding to real roots is
The formula comes from choosing six labels for the -interlacing data, common labels, and an ordering of the two subsets; it depends on the preceding tightly 3-interlacing conjecture and is presented as an upper-bound count that would become exact if that conjecture holds.
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.