ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG) be a finitely generated group and let f ⁣:N→Nf\colon \mathbb{N}\to\mathbb{N}. A filling length function of a finitely presentable group is the function measuring the maximal length occurring during fillings of null-homotopic words. A nondeterministic symmetric Turing machine is one whose computation relation is symmetric.

Birget's conjecture. There is a nondeterministic symmetric Turing machine accepting the language of words ww representing 11 in GG within space

f(ℓ(w))f(\ell(w))

up to the comparison relation ⪯\preceq if and only if GG embeds in a finitely presentable group with filling length function ⪯f\preceq f.

This is proposed as an analogue for filling length of the Birget–Ol'shanskii–Rips–Sapir characterization involving polynomial Dehn functions. The affirmative, or “if”, direction is covered by the cited Turing-machine theorem; the converse is the conjectural part.

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.