Uniqueness conjecture for Markov numbers of rigid strings
Statement
Let and be two -rigid strings. For a string , let denote the sum of Euler characteristics of the Grassmannians of subrepresentations of its associated string module.
Markov-number uniqueness conjecture. One has
if and only if and for all .
This conjecture asserts that the Markov number associated with an -rigid string determines the length and sequence of its string data, independently of the initial vertex. The source gives no evidence of a resolution.
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.