ProbXiv
Explorersign in
Problem archiveProblem record

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 CC be the 22-complex whose vertices are minimal triple diagrams and whose edges are 2↔22\leftrightarrow2 moves. Its 22-cells are squares for two different 2↔22\leftrightarrow2 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 22-complex CC has precisely these types of 22-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 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.