Combinatorial irreducibility and irreducibility of the drawing variety
Statement
Let be a constrained triangulation with an arbitrary boundary polygon. Combinatorial irreducibility conjecture. The triangulation is combinatorially irreducible if and only if is an irreducible variety.
This conjecture relates a combinatorial reduction property of constrained triangulations to the geometry of their drawing varieties. Its resolution is not specified in the supplied text.
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.