{"paper":{"title":"A characterization of Benford's Law in discrete-time linear systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.DS","authors_text":"Arno Berger, Gideon Eshun","submitted_at":"2014-07-22T23:01:18Z","abstract_excerpt":"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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6065","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}