ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let D′D' be a Go-diagram in a partition λ\lambda, and let c≺c′c\prec c' be a crossing and uncrossing pair in D′D' with D′(c)=∘D'(c)=\circ. Let DD be obtained by replacing the stones at cc and c′c' with ++. Let i<ji<j be the labels of the pipes crossing at cc in D′D'. The necessity conjecture. Suppose that, after recolouring stones appropriately, DD is a Go-diagram with no cells in the forbidden configuration, and that there is a label kk with i<k<ji<k<j such that kk forms a crossing and uncrossing pair with ii or jj between cc and c′c' in D′D'. Then

DD′⊄DD‾.\mathcal{D}_{D'}\not\subset\overline{\mathcal{D}_D}.

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 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.