SearcharxivSearch

arXiv · 1111.1287

Algebraic Yuzvinski Formula

Abstract

In 1965 Adler, Konheim and McAndrew defined the topological entropy for continuous self-maps of compact spaces. Topological entropy is very well-understood for endomorphisms of compact Abelian groups. A fundamental result in this context is the so-called Yuzvinski Formula, showing that the value of the topological entropy of a full solenoidal automorphism coincides with the Mahler measure of its characteristic polynomial. In two papers of 1979 and 1981 Peters gave a different definition of entropy for automorphisms of locally compact Abelian groups. This notion has been appropriately modified forendomorphisms in two recent papers, where it is called algebraic entropy. The goal of this paper is to prove a perfect analog of the Yuzvinski Formula for the algebraic entropy, namely, the Algebraic Yuzvinski Formula, giving the value of the algebraic entropy of an endomorphism of a finite-dimensional rational vector space as the Mahler measure of its characteristic polynomial. Finally, several applications of the Algebraic Yuzvinski Formula and related open problems are discussed.

Explore related subjects

Keep this discovery

BibTeXRIS

Anna Giordano Bruno, Simone Virili. 2011-11-05. Algebraic Yuzvinski Formula. https://arxiv.org/abs/1111.1287

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