Entropy of Bernoulli convolutions and uniform exponential growth for linear groups

preprint2021arXivOpen access

Abstract

The exponential growth rate of non polynomially growing subgroups of GLdGL_d is conjectured to admit a uniform lower bound. This is known for non-amenable subgroups, while for amenable subgroups it is known to imply the Lehmer conjecture from number theory. In this note, we show that it is equivalent to the Lehmer conjecture. This is done by establishing a lower bound for the entropy of the random walk on the semigroup generated by the maps x↦λ⋅x±1x\mapsto λ\cdot x\pm 1, where λλ is an algebraic number. We give a bound in terms of the Mahler measure of λλ. We also derive a bound on the dimension of Bernoulli convolutions.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.