ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let C=(x1:a1,a2,…,an)C=(x_1:a_1,a_2,\ldots,a_n) and C′=(x1′:a1′,a2′,…,am′)C'=(x'_1:a'_1,a'_2,\ldots,a'_m) be two EΛE_{\Lambda}-rigid strings. For a string DD, let m(D)m(D) denote the sum of Euler characteristics of the Grassmannians of subrepresentations of its associated string module.

Markov-number uniqueness conjecture. One has

m(C)=m(C′)m(C)=m(C')

if and only if n=mn=m and ai=ai′a_i=a'_i for all 1≤i≤n1\leq i\leq n.

This conjecture asserts that the Markov number associated with an EΛE_{\Lambda}-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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.