Papers
Topics
Authors
Recent
Search
2000 character limit reached

Bireversible automata generating lamplighter groups

Published 9 Jun 2022 in math.GR | (2206.04633v1)

Abstract: For every non-trivial finite abelian group $A$, we exhibit a bireversible automaton generating the lamplighter group $A \wr \mathbb{Z}$.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

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

Sign Up to Generate

Open Problems

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

Generate Now

Continue Learning

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

Generate Now

Collections

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

Sign Up