ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let R∈NpR\in\mathbb{N}^p, C∈NqC\in\mathbb{N}^q, and let M∈Mp,q({−1,0,1})\mathbf{M}\in\mathcal{M}_{p,q}(\{-1,0,1\}). For each integer ii, let Pi(M)\mathcal{P}_i(\mathbf{M}) denote the set of cells at level ii associated with M\mathbf{M}, and let Ci,i+1,k,k+1\mathbf{C}_{i,i+1,k,k+1} denote the corresponding elementary 2×22\times2 checkerboard move. Write A→A′\mathbf{A}\rightarrow\mathbf{A}' for the switching relation on matrices in M(R,C)\mathcal{M}(R,C). The simply connected level-set conjecture. We have A→A′\mathbf{A}\rightarrow\mathbf{A}' for all A,A′∈M(R,C)\mathbf{A},\mathbf{A}'\in\mathcal{M}(R,C) such that A′−A=M\mathbf{A}'-\mathbf{A}=\mathbf{M} if and only if both of the following conditions hold: (i) there exists T∈Mp−1,q−1(N)\mathbf{T}\in\mathcal{M}_{p-1,q-1}(\mathbb{N}) such that

M=∑i,ktikCi,i+1,k,k+1;\mathbf{M}=\sum_{i,k}t_{ik}\mathbf{C}_{i,i+1,k,k+1};

(ii) for every ii, each connected component of Pi(M)\mathcal{P}_i(\mathbf{M}) 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 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.