On finite extensions of lamplighter groups
By: Corentin Bodart
Potential Business Impact:
Answers math puzzles with tricky group rules.
We study a family of groups consisting of the simplest extensions of lamplighter groups. We use these groups to answer multiple open questions in combinatorial group theory, providing groups that exhibit various combinations of properties: 1) Decidable Subgroup Membership and undecidable Uniform Subgroup Membership Problem, 2) Rational volume growth series and undecidable Word Problem and 3) Recursive (even context-free) language of conjugacy geodesics, decidable Word Problem, and undecidable Conjugacy Problem. We also consider the co-Word Problem, residual finiteness and the Isomorphism Problem within this class.
Similar Papers
On linguistic subsets of groups and monoids
Group Theory
Makes math problems about groups easier to solve.
Determining unit groups and $\mathrm{K}_1$ of finite rings
Number Theory
Finds hidden math patterns in numbers.
On groups with EDT0L word problem
Group Theory
Groups with simple math problems can't be infinite.