SearcharxivSearch

arXiv · 1901.05065

Near actions

Abstract

A near permutation of a set is a bijection between two cofinite subsets, modulo coincidence on smaller cofinite subsets. Near permutations of a set form its near symmetric group. In this monograph, we define near actions as homomorphisms into this group, and perform a systematic study of this notion. Notably, we deal with the problem of realizability: how far is a near action from being induced by an action? Also, what invariants of group actions are actually invariants of the underlying near action? the most fundamental one is the space of ends. We notably provide a classification of near actions of finitely generated abelian groups. There are several examples of exotic near actions of the free abelian group of rank two, which we classify according to a positive integer, called winding number, and an integral vector, called additive holonomy. In contrast, we prove that there are no such exotic near actions in higher rank abelian groups. We also obtain results for other groups; for instance, every near action of SL(2,Z) is realizable; this is not true for arbitrary amalgams of two finite cyclic groups. We introduce and study almost and near automorphism groups, which have been considered for some particular graphs or labeled graphs, in the general setting of relational structures.

Explore related subjects

Keep this discovery

BibTeXRIS

Yves Cornulier. 2019-01-14. Near actions. https://arxiv.org/abs/1901.05065

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