The triple-diagram relations-between-relations conjecture
Statement
A triple diagram is a diagram in the paper's class, and a minimal triple diagram is one with no reducible features under the allowed simplification moves. Fix a connectivity of diagrams and let be the -complex whose vertices are minimal triple diagrams and whose edges are moves. Its -cells are squares for two different moves in non-interfering parts of the diagram, pentagons as in the left side of Figure 1 or with reversed orientation, and decagons as in the right side of Figure 1.
Relations-between-relations conjecture. The -complex has precisely these types of -cells.
This conjecture describes relations among the local moves relating minimal triple diagrams. The surrounding discussion identifies the pentagonal and decagonal cells geometrically; the supplied text does not state whether the conjecture has been proved or disproved.
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.