ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a coupler curve with a coupler decomposition (T1,…,Tn)(T_1,\ldots,T_n), and let (α1,…,αn)(\alpha_1,\ldots,\alpha_n) be a class partition for the underlying calligraph G{\mathcal{G}} such that

deg⁡Ti=αi⋅(1,0,0)\deg T_i=\alpha_i\cdot(1,0,0)

and

g(Ti)≤12⋅αi⋅(αi−(2,1,1))+1−∣sing⁡Ti∣.g(T_i) \leq \tfrac{1}{2}\cdot\alpha_i\cdot\bigl(\alpha_i-(2,1,1)\bigr)+1-|\operatorname{sing} T_i|.

Equal-degree and equal-genus conjecture. For almost all edge length assignments, for all 1≤i,j≤n1\leq i,j\leq n,

deg⁡Ti=deg⁡Tj\deg T_i=\deg T_j

and

g(Ti)=g(Tj)=12⋅αi⋅(αi−(2,1,1))+1−∣sing⁡Ti∣.g(T_i)=g(T_j)=\tfrac{1}{2}\cdot\alpha_i\cdot\bigl(\alpha_i-(2,1,1)\bigr)+1-|\operatorname{sing} T_i|.

The conjecture predicts that every component of a generic coupler curve has the same degree and geometric genus, and that the genus bound from the preceding corollary is attained for every component. The supplied text 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.