Kogan's five-type classification conjecture for triples of triangles
Statement
A linking of triangles is a set of pairwise disjoint, non-degenerate triangles in 3-space; triangles are understood as their outlines, with unnumbered vertices and no orientation. Two linkings are combinatorially isotopic if one can be obtained from the other by a sequence of elementary moves, where an elementary move replaces one triangle by while the swept triangular regions remain disjoint from every other triangle.
Kogan's classification conjecture. Any linking of three non-ordered triangles is combinatorially isotopic to one of the following five types: three triangles whose convex hulls are pairwise disjoint; the Borromean or Valknut linking; a Hopf linking of two triangles together with a third triangle whose convex hull is disjoint from the first two; a triangle together with two triangles whose convex hulls are disjoint and both intersect the first triangle at exactly one point; or the specified linking formed by an equilateral triangle and two successive rotations by and translations by , where is the altitude of the preceding triangle. Linkings from different types should not be combinatorially isotopic.
This conjecture proposes a complete classification of three-triangle linkings under combinatorial isotopy. The paper proves that the standard triple and the Borromean triple are not combinatorially isotopic, but the proposed completeness of the five-type list remains open.
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.