Birget's filling-length characterization of nondeterministic symmetric space
Statement
Let ) be a finitely generated group and let . 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 representing in within space
up to the comparison relation if and only if embeds in a finitely presentable group with filling length function .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.