ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A map is a 22-cell decomposition of a closed compact surface, and its size is measured by nn, the number of darts. Two maps are isomorphic when there is a bijection preserving their vertex-edge-face incidences. The genus is unrestricted when no bound on the genus of the underlying surface is imposed.

Map-isomorphism conjecture. There is no ε>0\varepsilon > 0 for which there is an algorithm for testing isomorphism of maps of unrestricted genus in time

O(n2−ε).\mathcal{O}(n^{2-\varepsilon}).

The currently described algorithm gives an O(n2/log⁡n)\mathcal{O}(n^2/\log n) procedure, which is not considered truly subquadratic; the conjecture asserts that no polynomial improvement to an exponent strictly below 22 is possible. Its resolution is not 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.