arXiv (OAI Expanded)
open access
An Erdős-Wintner theorem for second-order linear recurrent bases
Let $a,b$ be integers with $1\le b\le a$, and let \[ G_0=1,\qquad G_1=a+1,\qquad G_{n+2}=aG_{n+1}+bG_n. \] For real-valued functions which are additive in the greedy $G$-digits, we prove a necessary-and-sufficient criterion for the existence of a limiting distribution. The criterion consists of
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- An Erdős-Wintner theorem for second-order linear recurrent bases#781040
- Multiplicative independence in the sequence of $k$-generalized Pell numbers#1034735
- Sequence Reconstruction over the Deletion Channel#1049697
- On Sequence Reconstruction Problem for q-ary Deletion Channels#1122831
- An algebraic approach to product-form stationary distributions for some reaction networks#1051931
Record · ID 779665
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive