Linear recurrence relations, primitivity and Benford's law

DOI10.4171/EM/213zbMATH Open1286.11116arXiv1007.5349MaRDI QIDQ372500FDOQ372500

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 $(a_n)$ defined by finite linear difference equations $a_{n+k}=c_{k-1}{a}_{n+k-1}+\mathrm{...}+c_0{a}_n$ with suitable non negative reals coefficients $c_i$ satisfy Bendford's Law on the first digit in many bases $b>2$. 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

zbMATH Keywords

Benford's lawlinear recurrence

Mathematics Subject Classification ID

Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16) Recurrences (11B37)

Cited In (3)

• Title not available (Why is that?)
• Benford's law, recurrence relations, and uniformly distributed sequences. II
• 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)