A characterization of Benford's Law in discrete-time linear systems
Arno Berger, Gideon Eshun

TL;DR
This paper establishes a necessary and sufficient condition, called 'nonresonance', for solutions of linear difference equations to follow Benford's Law, unifying and extending previous results in the literature.
Contribution
It introduces the 'nonresonance' condition as a comprehensive criterion for Benford behavior in linear systems, encompassing all prior special cases.
Findings
The 'nonresonance' condition characterizes when solutions follow Benford's Law.
The condition applies to all solutions of autonomous linear difference equations.
Implications for number theory and potential extensions are discussed.
Abstract
A necessary and sufficient condition ("nonresonance") is established for every solution of an autonomous linear difference equation, or more generally for every sequence with and , to be either trivial or else conform to a strong form of Benford's Law (logarithmic distribution of significands). This condition contains all pertinent results in the literature as special cases. Its number-theoretical implications are discussed in the context of specific examples, and so are its possible extensions and modifications.
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 · Analytic Number Theory Research
