The simply connected level-set conjecture for checkerboard switching
Statement
Let , , and let . For each integer , let denote the set of cells at level associated with , and let denote the corresponding elementary checkerboard move. Write for the switching relation on matrices in . The simply connected level-set conjecture. We have for all such that if and only if both of the following conditions hold: (i) there exists such that
(ii) for every , each connected component of is simply connected. The conjecture removes condition (iii) from the preceding sufficient theorem and predicts that failure of simple connectivity is exactly the obstruction to universal switchability.
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.