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 has arbitrarily large finite subgroups if, for every positive integer nn, it contains a finite subgroup of order greater than nn.

Bounded finite-subgroup conjecture. If a group GG is poly-context-free, then GG does not have arbitrarily large finite subgroups.

The conjecture is motivated by the fact that context-free groups are virtually free and therefore cannot contain arbitrarily large finite subgroups. The source presents the stronger assertion as open and as a possible route toward excluding the remaining torsion case in the soluble classification.

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.