SearcharxivSearch

arXiv · 2411.11806

Cyclicity, hypercyclicity and randomness in self-similar groups

Abstract

We introduce the concept of cyclicity and hypercyclicity in self-similar groups as an analogue of cyclic and hypercyclic vectors for an operator on a Banach space. We derive a sufficient condition for cyclicity of non-finitary automorphisms in contracting discrete automata groups. In the profinite setting we prove that fractal profinite groups may be regarded as measure-preserving dynamical systems and derive a sufficient condition for the ergodicity and the mixing properties of these dynamical systems. Furthermore, we show that a Haar-random element in a super strongly fractal profinite group is hypercyclic almost surely as an application of Birkhoff's ergodic theorem for free semigroup actions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jorge Fariña-Asategui. 2024-11-18. Cyclicity, hypercyclicity and randomness in self-similar groups. https://doi.org/10.1007/s00605-025-02061-6

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