ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let XX be a digital image, meaning a finite graph-like digital topological space, and let CnC_n denote the cycle of nn points. Call XX non-rigid if it admits a continuous self-map homotopic to the identity that is not the identity, and irreducible if it has no proper image homotopy equivalent to it. Let the adjacency graph of XX be the graph whose vertices are the points of XX and whose edges join adjacent points.

Planarity conjecture. If XX is a non-rigid irreducible digital image that is not isomorphic to CnC_n, then the adjacency graph of XX is not planar.

The conjecture is motivated by the enumeration of small connected digital images: the known non-rigid irreducible examples other than cycles have nonplanar adjacency graphs. It proposes that planarity excludes all further non-rigid irreducible images, but no resolution is supplied here.

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.