ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let T\pentagon{\mathcal{T}}_{\pentagon} be a constrained triangulation with an arbitrary boundary polygon. Combinatorial irreducibility conjecture. The triangulation T\pentagon{\mathcal{T}}_{\pentagon} is combinatorially irreducible if and only if X^(T\pentagon)\hat X({\mathcal{T}}_{\pentagon}) 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 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.