pith. sign in

arxiv: 1407.6065 · v1 · pith:VCYKFD7Nnew · submitted 2014-07-22 · 🧮 math.DS · math.NT

A characterization of Benford's Law in discrete-time linear systems

classification 🧮 math.DS math.NT
keywords benfordconditioneverylinearmathbbautonomouscasescharacterization
0
0 comments X
read the original abstract

A necessary and sufficient condition ("nonresonance") is established for every solution of an autonomous linear difference equation, or more generally for every sequence $(x^\top A^n y)$ with $x,y\in \mathbb{R}^d$ and $A\in \mathbb{R}^{d\times d}$, 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.