On logarithmically Benford sequences

From MaRDI portal
Publication:2821722




Abstract: Let mathcalIsubsetmathbbN be an infinite subset, and let aiiinmathcalI be a sequence of nonzero real numbers indexed by mathcalI such that there exist positive constants m,C1 for which |ai|leqC1cdotim for all iinmathcalI. Furthermore, let ciin[1,1] be defined by ci=fracaiC1cdotim for each iinmathcalI, and suppose the ci's are equidistributed in [1,1] with respect to a continuous, symmetric probability measure mu. In this paper, we show that if mathcalIsubsetmathbbN is not too sparse, then the sequence aiiinmathcalI fails to obey Benford's Law with respect to arithmetic density in any sufficiently large base, and in fact in any base when mu([0,t]) is a strictly convex function of tin(0,1). Nonetheless, we also provide conditions on the density of mathcalIsubsetmathbbN under which the sequence aiiinmathcalI satisfies Benford's Law with respect to logarithmic density in every base. As an application, we apply our general result to study Benford's Law-type behavior in the leading digits of Frobenius traces of newforms of positive, even weight. Our methods of proof build on the work of Jameson, Thorner, and Ye, who studied the particular case of newforms without complex multiplication.









This page was built for publication: On logarithmically Benford sequences

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