Erdős-Wintner theorem for linear recurrent bases
arXiv:2512.20882
Abstract
Let be a linear recurrence sequence defining a numeration system and satisfying mild structural hypotheses. For real-valued G-additive functions (additive in the greedy G-digits), we establish an Erdős-Wintner-type theorem: convergence of two canonical series (a first-moment series and a quadratic digit-energy series) is necessary and sufficient for the existence of a limiting distribution along initial segments of the integers. In that case, the limiting characteristic function admits an explicit infinite-product factorization whose local factors depend only on the underlying digit system. We also indicate conditional extensions of this two-series criterion to Ostrowski numeration systems with bounded partial quotients and to Parry -expansions with Pisot-Vijayaraghavan base .
Withdrawn due to gaps in the proof of the main theorem, specifically in the block decomposition and auxiliary estimates in Section 3