The cone-type minimality conjecture for spherical triangulations
Statement
Let be a spherical triangulation whose vertices have degree or . A cycle in is bad if it has length and separates two vertices of degree greater than in . A cone-type triangulation at a vertex is a triangulation in which every tetrahedron contains and a face in . Let and be the triangulations associated with the construction in the paper.
Cone-type minimality conjecture. If has no bad cycle, then the cone-type triangulation at a degree- vertex is minimal, and
This conjecture would identify a combinatorial condition guaranteeing minimality of the cone-type tetrahedral decomposition and would produce pairs realizing the stated flip distance. No resolution is given 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.