Limit free computation of entropy
From MaRDI portal
Publication:4913612
Abstract: Various limit-free formulas are given for the computation of the algebraic and the topological entropy, respectively in the settings of endomorphisms of locally finite discrete groups and of continuous endomorphisms of totally disconnected compact groups. As applications we give new proofs of the connection between the algebraic and the topological entropy in the abelian case and of the connection of the topological entropy with the finite depth for topological automorphisms.
Recommendations
- Topological entropy for automorphisms of totally disconnected locally compact groups
- The topological entropy of endomorphisms of Lie groups
- Entropy for endomorphisms of LCA groups
- Topological entropy and algebraic entropy for group endomorphisms
- The connection between topological and algebraic entropy
Cited in
(19)- Topological entropy for locally linearly compact vector spaces
- Two new proofs concerning the intrinsic algebraic entropy
- Entropy on abelian groups
- Inertial properties in groups
- The connection between topological and algebraic entropy
- Entropy on normed semigroups (towards a unifying approach to entropy)
- Algebraic entropy for amenable semigroup actions
- Topological entropy for automorphisms of totally disconnected locally compact groups
- Topological entropy for locally linearly compact vector spaces and field extensions
- Topological entropy in totally disconnected locally compact groups
- A bridge theorem for the entropy of semigroup actions
- Algebraic entropy on strongly compactly covered groups
- When the intrinsic algebraic entropy is not really intrinsic
- Intrinsic valuation entropy
- Scale function vs topological entropy
- Algebraic entropies for abelian groups with applications to the structure of their endomorphism rings: a survey
- The addition theorem for algebraic entropies induced by non-discrete length functions
- Algebraic entropy in locally linearly compact vector spaces
- The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
This page was built for publication: Limit free computation of entropy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4913612)