The necessity conjecture for intermediate crossing–uncrossing pairs in Go-diagrams
Statement
Let be a Go-diagram in a partition , and let be a crossing and uncrossing pair in with . Let be obtained by replacing the stones at and with . Let be the labels of the pipes crossing at in . The necessity conjecture. Suppose that, after recolouring stones appropriately, is a Go-diagram with no cells in the forbidden configuration, and that there is a label with such that forms a crossing and uncrossing pair with or between and in . Then
The source presents this as the conjectured necessity of the second condition in the preceding closure conjecture. It is motivated by the failure of the first condition alone, but no proof or resolution is supplied.
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.