Entropy of Bernoulli convolutions and uniform exponential growth for linear groups

From MaRDI portal
Publication:2177498



Abstract: The exponential growth rate of non polynomially growing subgroups of GLd 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 xmapstolambdacdotxpm1, where lambda is an algebraic number. We give a bound in terms of the Mahler measure of lambda. We also derive a bound on the dimension of Bernoulli convolutions.


This paper shows that the conjectured uniform lower bound on the exponential growth rate of non-polynomially growing subgroups of \(\mathrm{GL}_d\) is equivalent to the Lehmer problem in number theory, which asks whether there is a positive lower bound for the logarithmic Mahler measure of all integral polynomials. The argument involves studying the entropy of the random walk on the semi-group generated by the maps \(x\mapsto\lambda x+1\) and \(x\mapsto\lambda x-1\) for an algebraic number \(\lambda\), and relating it to the Mahler measure of an algebraic number \(\lambda\). In addition, a new connection between the Lehmer problem and dimension properties of the Bernoulli convolution associated to algebraic numbers is found. The analysis also gives new results independent of the Lehmer problem, including a large collection of parameter values for which the corresponding Bernoulli convolution has full dimension.



Cites work


Cited in
(22)








This page was built for publication: Entropy of Bernoulli convolutions and uniform exponential growth for linear groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2177498)