Relations de r\'ecurrence lin\'eaires, primitivit\'e et loi de Benford
Hugues Deligny, Paul Jolissaint

TL;DR
This paper demonstrates that many linear recurrence sequences with non-negative coefficients follow Benford's Law in various bases, using Perron-Frobenius theory applied to the sequence's characteristic polynomial.
Contribution
It establishes a connection between linear recurrence sequences and Benford's Law, providing a theoretical proof based on Perron-Frobenius theory.
Findings
Sequences defined by linear difference equations follow Benford's Law in multiple bases.
The proof utilizes Perron-Frobenius theory and the companion matrix of the characteristic polynomial.
Many such sequences exhibit Benford behavior under suitable conditions.
Abstract
We prove that many sequences of positive numbers defined by finite linear difference equations with suitable non negative reals coefficients satisfy Bendford's Law on the first digit in many bases . Our techniques rely on Perron-Frobenius theory via the companion matrix of the characteristic polynomial of the defining equation.
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.
