The bounded finite-subgroup conjecture for poly-context-free groups
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 , it contains a finite subgroup of order greater than .
Bounded finite-subgroup conjecture. If a group is poly-context-free, then 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.