SearcharxivSearch

arXiv · 2110.05788

Groups of piecewise isometric permutations of lattice points or finitary rearrangements of tessellations

Abstract

Through the glasses of didactic reduction: We consider a (periodic) tessellation $\Delta$ of either Euclidean or hyperbolic $n$-space $M$. By a piecewise isometric rearrangement of $\Delta$ we mean the process of cutting $M$ along corank-1 tile-faces into finitely many convex polyhedral pieces, and rearranging the pieces to a new tight covering of the tessellation $\Delta$. Such a rearrangement defines a permutation of the (centers of the) tiles of $\Delta$, and we are interested in the group $PI(\Delta)$ of all piecewise isometric rearrangements of $\Delta$. In this paper we offer: a) An illustration of piecewise isometric rearrangements in the visually attractive hyperbolic plane, b) an explanation how this is related to Richard Thompson's groups, c) a chapter on the structure of the group pei$(\mathbb Z^n)$ of all piecewise Euclidean rearrangements of the standard tessellation of $\mathbb R^n$ by unit-cubes, and d) results on the finiteness properties of some subgroups of pei$(\mathbb Z^n)$.

Explore related subjects

Keep this discovery

BibTeXRIS

Robert Bieri, Heike Sach. 2021-10-12. Groups of piecewise isometric permutations of lattice points or finitary rearrangements of tessellations. https://arxiv.org/abs/2110.05788

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR