Toroidal irreducibility and irreducibility of the drawing variety
Statement
Let be a constrained triangulation of a parallelogram, and call it toroidally irreducible if it is combinatorially irreducible and there do not exist constraints with and , or constraints with and . Toroidal irreducibility conjecture. If is toroidally irreducible, then 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.