ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let d4d8d4d8 be a non-trivial hereditary property, and let d4d2(d4d8)d4d2(d4d8) be the set of CRGs avoiding its forbidden graphs. For each pa[0,1]p a[0,1], let gK(p)g_K(p) denote the quadratic minimization function associated with a CRG KK. Martin's finite CRG conjecture. For every d700>0d700>0, there is a finite subset d4d2′\subseteqd4d2(d4d8)d4d2'\subseteqd4d2(d4d8) such that

ed⁡H(p)=min⁡K∈K′gK(p),for all p∈(ε,1−ε).\operatorname{ed}_{\mathcal{H}}(p)=\min_{K\in\mathcal{K}'}g_K(p),\qquad\text{for all }p\in(\varepsilon,1-\varepsilon).

This conjecture asks whether the edit distance function is determined by finitely many CRGs uniformly on every compact subinterval of (0,1)(0,1).

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.