ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A group is poly-context-free if its word problem is an intersection of finitely many context-free languages. A group is virtually abelian if it has an abelian subgroup of finite index.

Soluble poly-context-free group conjecture. Every finitely generated soluble group is poly-context-free if and only if it is virtually abelian.

This is the soluble specialization of the general classification conjecture. The source proves that a finitely generated poly-context-free soluble group is virtually abelian except possibly for a case involving an infinite normal torsion subgroup, so the conjecture remains open there.

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.