ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P\mathcal{P} be a weakly connected collection of cells, and let IPI_{\mathcal{P}} denote its polyomino ideal. A zig-zag walk is the particular sequence of inner intervals of P\mathcal{P} defined in the preceding theory. Primality conjecture. The following are equivalent:

IP is prime;I_{\mathcal{P}}\text{ is prime};

and P\mathcal{P} has no zig-zag walks. Equivalently, absence of zig-zag walks in a weakly connected collection of cells characterizes the primality of its polyomino ideal. The conjecture extends the corresponding characterization from polyominoes to weakly connected collections of cells. The paper notes examples showing that weak connectivity alone does not force primality, while earlier computational results establish the condition for polyominoes consisting of at most fourteen cells and prior work proves it for certain classes such as closed paths; the general equivalence remains open.

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.