Papers
Topics
Authors
Recent
Search
2000 character limit reached

Groups with presentations in EDT0L

Published 2 Feb 2024 in math.GR | (2402.01601v2)

Abstract: To any family of languages LAN, let us associate the class, denoted $\pi(\text{LAN})$, of finitely generated groups that admit a group presentation whose set of relators forms a language in LAN. We show that the class of L-presented groups, as introduced by the first author in 2003, is exactly the class of groups that admit presentations in the family of languages EDT0L. We show that the marked isomorphism problem is not semi-decidable for groups given by EDT0L presentations, contrary to the finite presentation case. We then extend and unify results of the first author with Eick and Hartung about nilpotent and finite quotients, by showing that it is possible to compute the marked hyperbolic and marked metabelian quotients of a group given by an EDT0L presentation. Finally, we show how the results about quotient computations enable the construction of recursively presented groups that do not have EDT0L presentations, thus proving $\pi(\text{EDT0L})\ne \pi(\text{REC})$. This is done by building a residually nilpotent group with solvable word problem whose sequence of maximal nilpotent quotients is non-computable.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.