Red-size conjectures for connected quivers without reddening sequences
Statement
Let be a connected quiver, let be its vertex set, and suppose that does not admit a reddening sequence. A general maximal green sequence is a mutation sequence resulting in one remaining green vertex, while a general reddening sequence is the corresponding unrestricted notion. Red-size conjecture. The source proposes the following versions, from weakest to strongest:
- .
- , and every vertex of is the last remaining green vertex after some general maximal green sequence.
- .
- , and every vertex of is the last remaining green vertex after some general reddening sequence.
These conjectures assert that connected quivers without reddening sequences can nevertheless be mutated to sequences with only one remaining green vertex. The paper states that even the weakest version implies mutation invariance of unrestricted red size and focuses on establishing special cases; the conjectures are not resolved in the supplied text.
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.