ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let T{\mathcal{T}} be a constrained triangulation of a parallelogram, and call it toroidally irreducible if it is combinatorially irreducible and there do not exist constraints C,C′C,C' with {p,q}⊂C{\{\mathbf{p},\mathbf{q}\}}\subset C and {r,s}⊂C′{\{\mathbf{r},\mathbf{s}\}}\subset C', or constraints C,C′C,C' with {q,r}⊂C{\{\mathbf{q},\mathbf{r}\}}\subset C and {p,s}⊂C′{\{\mathbf{p},\mathbf{s}\}}\subset C'. Toroidal irreducibility conjecture. If T{\mathcal{T}} is toroidally irreducible, then X^(T)\hat X({\mathcal{T}}) is irreducible.

This is the analogue of the preceding irreducibility claim after identifying opposite boundary edges to form a torus. The supplied text does not indicate whether the conjecture has been resolved.

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.