On Logarithmically Benford Sequences
Evan Chen, Peter S. Park, Ashvin Swaminathan

TL;DR
This paper investigates conditions under which sequences with equidistributed normalized terms follow Benford's Law, especially focusing on the influence of sequence density and applying results to Frobenius traces of newforms.
Contribution
It establishes new criteria linking sequence density and equidistribution to Benford's Law adherence in various bases, extending previous work on newforms.
Findings
Sequences with certain density conditions fail Benford's Law in all bases.
Logarithmic density can ensure Benford behavior under specific conditions.
Application to Frobenius traces of newforms demonstrates practical relevance.
Abstract
Let be an infinite subset, and let be a sequence of nonzero real numbers indexed by such that there exist positive constants for which for all . Furthermore, let be defined by for each , and suppose the 's are equidistributed in with respect to a continuous, symmetric probability measure . In this paper, we show that if is not too sparse, then the sequence fails to obey Benford's Law with respect to arithmetic density in any sufficiently large base, and in fact in any base when is a strictly convex function of . Nonetheless, we also provide conditions on the density of $\mathcal{I}…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBenford’s Law and Fraud Detection · Computability, Logic, AI Algorithms
