Near actions

Publication date 14 January 2019

Other combinatorial set theory (03E05) Descriptive set theory (03E15) Logical aspects of Boolean algebras (03G05) Infinite graphs (05C63) Stone spaces (Boolean spaces) and related structures (06E15) Categories of sets, characterizations (18B05) General theory for infinite permutation groups (20B07) Infinite automorphism groups (20B27) Symmetric groups (20B30) Geometric group theory (20F65) Inverse semigroups (20M18) Semigroups of transformations, relations, partitions, etc. (20M20) Representation of semigroups; actions of semigroups on sets (20M30) General theory of group and pseudogroup actions (22F05) Groups as automorphisms of other structures (22F50) Dynamics induced by group actions other than (mathbb{Z}) and (mathbb{R}), and (mathbb{C}) (37C85)

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.

This page was built for publication: Near actions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6312515)