Entropy of Bernoulli convolutions and uniform exponential growth for linear groups
arXiv:1510.04043 · doi:10.1007/s11854-020-0100-0
Abstract
The exponential growth rate of non polynomially growing subgroups of 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 , 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.
arXiv commentAdded the requirement to Remark 6 that lambda is a unit. This is relevant only in the case of generalised Bernoulli convolutions, when the coefficients are not +/-1. Final accepted version. To appear in J. Anal. Math. 33 pages
References in corpus (8)
- On self-similar sets with overlaps and inverse theorems for entropy
- Sumset and inverse sumset theorems for Shannon entropy
- Sumset and Inverse Sumset Inequalities for Differential Entropy and Mutual Information
- Absolute continuity of Bernoulli convolutions for algebraic parameters
- On the dimension of Bernoulli convolutions
- Infinite groups with large balls of torsion elements and small entropy
- A lower bound for Garsia's entropy for certain Bernoulli convolutions
- Absolute continuity of complex Bernoulli convolutions