Adjoint algebraic entropy

Dikran Dikranjan; Anna Giordano Bruno; Luigi Salce

doi:10.1016/j.jalgebra.2010.03.025

Home/Archive/arXiv

arXiv · 1006.5204

Adjoint algebraic entropy

Dikran Dikranjan·Anna Giordano Bruno·Luigi Salce

View original source ↗Read source document ↗Export metadata ↓

Abstract

The new notion of adjoint algebraic entropy of endomorphisms of Abelian groups is introduced. Various examples and basic properties are provided. It is proved that the adjoint algebraic entropy of an endomorphism equals the algebraic entropy of the adjoint endomorphism of the Pontryagin dual. As applications, we compute the adjoint algebraic entropy of the shift endomorphisms of direct sums, and we prove an Addition Theorem for the adjoint algebraic entropy of bounded Abelian groups. A dichotomy is established, stating that the adjoint algebraic entropy of any endomorphism can take only values zero or infinity. As a consequence, we obtain the following surprising discontinuity criterion for endomorphisms: every endomorphism of a compact abelian group, having finite positive algebraic entropy, is discontinuous.

Explore related subjects

math.GR

Keep this discovery

BibTeX RIS

Dikran Dikranjan, Anna Giordano Bruno, Luigi Salce. 2010-06-27. Adjoint algebraic entropy. https://doi.org/10.1016/j.jalgebra.2010.03.025

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗