SearcharxivSearch

arXiv · 1308.4035

Discrete dynamical systems in group theory

Abstract

In this expository paper we describe an unifying approach for many known entropies in Mathematics. First we recall the notion of semigroup entropy h_S in the category S of normed semigroups and contractive homomorphisms, recalling also its properties. For a specific category X and a functor F from X to S, we have the entropy h_F, defined by the composition of h_S with F, which automatically satisfies the same properties proved for h_S. This general scheme permits to obtain many of the known entropies as h_F, for appropriately chosen categories X and functors F. In the last part we recall the definition and the fundamental properties of the algebraic entropy for group endomorphisms, noting how its deeper properties depend on the specific setting. Finally we discuss the notion of growth for flows of groups, comparing it with the classical notion of growth for finitely generated groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Dikran Dikranjan, Anna Giordano Bruno. 2013-08-19. Discrete dynamical systems in group theory. https://arxiv.org/abs/1308.4035

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