SearcharxivSearch

arXiv · 1901.08895

Fixating Group Actions

Abstract

A group of bijections G acting on a set X is said with fixed points (abbreviated as gaf from the french "groupe {\`a} points fixes") if any element of G has at least one fixed point in X. The G group is said with a common fixed point (abbreviated as gag for "groupe {\`a} point fixe global") if there is x $\in$ X fixed by all elements of G. The group G is said fixating if any subgroup of G which is a gaf is automatically a gag. The article explores which groups are fixating. The situation depends on the assumptions made on the group of bijections and on the support set X. For example the group of isometries of the Euclidean space R n is fixating for n 3 but not for n 4. The case of isometries of elliptic and hyperbolic spaces is also considered, as well as that of isometries of some discrete sets. As we will see, the situation depends upon the fact whether the so-called median inequality is satisfied in the ambient space or not. Besides, some of our constructions of nonfixating groups rely on the existence of free subgroups of certain linear groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Guido Ahumada, Bernard Brighi, Nicolas Chevallier, Augustin Fruchard. 2019-01-25. Fixating Group Actions. https://arxiv.org/abs/1901.08895

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