2000 character limit reached
Nonstandard Cayley automatic representations of fundamental groups
Published 14 Jan 2020 in math.GR and cs.FL | (2001.04743v1)
Abstract: We construct a new family of Cayley automatic representations of semidirect products $\mathbb{Z}n \rtimes_A \mathbb{Z}$ for which none of the projections of the normal subgroup $\mathbb{Z}n$ onto each of its cyclic components is finite automaton recognizable. For $n=2$ we describe a family of matrices from $\mathrm{GL}(2,\mathbb{Z})$ corresponding to these representations. We are motivated by a problem of characterization of all possible Cayley automatic representations of these groups.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.