Regular completions of $\mathbb{Z}^n$-free groups
Olga Kharlampovich, Alexei Miasnikov, Denis Serbin

TL;DR
This paper proves that any finitely generated $Z^n$-free group can be embedded into a finitely generated regular $Z^n$-free group, preserving the action and allowing effective construction via $Z^n$-words.
Contribution
It introduces the concept of regular $Z^n$-completion, showing how to embed groups into regular actions while maintaining effectiveness.
Findings
Every finitely generated $Z^n$-free group can be embedded into a regular $Z^n$-free group.
The construction of the regular completion is effective and preserves the group's $Z^n$-word representation.
The embedding preserves the original group's action on the $Z^n$-tree.
Abstract
In the present paper we continue studying regular free group actions on -trees. We show that every finitely generated -free group can be embedded into a finitely generated -free group acting regularly on the underlying -tree (we call a {\em regular -completion} of ) so that the action of is preserved. Moreover, if is effectively represented as a group of -words then the construction of is effective and is also effectively represented as a group of -words.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · semigroups and automata theory · Advanced Graph Theory Research
