Linear recurrence relations, primitivity and Benford's law
From MaRDI portal
Publication:372500
DOI10.4171/EM/213zbMATH Open1286.11116arXiv1007.5349MaRDI QIDQ372500FDOQ372500
Authors: Hugues Deligny, Paul Jolissaint
Publication date: 8 October 2013
Published in: Elemente der Mathematik (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1007.5349
Recommendations
- Recurrence relations and Benford's law
- Benford's law, recurrence relations and equidistributed series
- A note on Benford's law for second order linear recurrences with periodical coefficients
- On the Uniform Distribution of Certain Sequences and Benford's law
- Benford's law, recurrence relations, and uniformly distributed sequences. II
Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16) Recurrences (11B37)
Cited In (6)
- Most linear flows on \(\mathbb{R}^d\) are Benford
- Title not available (Why is that?)
- Benford's law, recurrence relations, and uniformly distributed sequences. II
- On non-linear recursive sequences and Benford's law
- Recurrence relations and Benford's law
- Benford's law, recurrence relations and equidistributed series
This page was built for publication: Linear recurrence relations, primitivity and Benford's law
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q372500)