ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finitely generated group, and let C\mathbf{C} be a class of languages closed under inverse homomorphism.

Flatness–word-problem conjecture. GG is C∀\mathbf{C}^\forall-flat if and only if the word problem of GG lies in C\mathbf{C}.

This conjecture would connect the notion of C∀\mathbf{C}^\forall-flatness with the word problem. It is refuted: the classes of poly-context-free, context-sensitive, and recursive languages provide counterexamples.

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.