Untangling conjecture for admissible qq-characters
Statement
Let be an admissible -character with a dominant monomial. Its graph may be equipped with a supplement satisfying the compatibility condition around every square, and an incomplete square is a configuration in which exactly three vertices of an associated square occur, connected by two arrows. A -character is untangled when its graph has a supplement and no incomplete squares. Untangling conjecture. Any admissible -character with a dominant monomial is untangled. This predicts that admissibility and the presence of a dominant monomial rule out incomplete-square obstructions and guarantee the required global edge supplement.
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.