SearcharxivSearch

arXiv · 1606.07728

Groups of piecewise isometric permutations of lattice points

Abstract

Let M denote either Euclidean or hyperbolic n-space, and let G be a discrete group of isometries of M, with the property that G respects and acts tile-transitively on a convex-polyhedral tesselation of M. Given an arbitrary base point p in M, we consider the orbit Gp in M and define a notion of "G-polyhedral pieces" S in Gp. The objects of our interest are the groups pi(S) of all piecewise G-isometric permutations on S. In this paper we merely present the two most basic examples, and these play rather different roles: The case when G = PSL(2,Z) acting on the hyperbolic plane reveals that the "piecewise hyperbolic" groups phi(Gp) here have prominent relatives: they are closely related to Richard Thompson's group V. And in the Euclidean case when G = Isom(Z^n) we find that the "piecewise Euclidean" groups pei(S) - as well as the corresponding "piecewise translation" groups pet(S) - have divers but to some extent accessible finiteness properties.

Explore related subjects

Keep this discovery

BibTeXRIS

Robert Bieri, Heike Sach. 2016-06-24. Groups of piecewise isometric permutations of lattice points. https://arxiv.org/abs/1606.07728

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