arXiv (All)
open access
Some applications of binary numeration systems with nonzero redundancy to the theory of locally complex functions
In this paper, we study a numeration system with a non--integer base $a>1$ over the binary alphabet $A=\{0,1\}$: $$\left[0;\frac{r}{a-1}\right]\ni x=\sum\limits_{n=1}^{\infty}\frac{α_n}{a^n} \equiv Δ^{r_a}_{α_1α_2\ldotsα_n\ldots}, \quad α_n\in A.$$ We investigate the geometry of $r_a$--representatio
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
- Common invariant measures for beta-transformations with rational affine relations#1105714
- Vô conjecture 31 series 1(VC31S1)#690338
- Vô conjecture 31 series 3(VC31S3)#693933
- Vô conjecture 31 series 4(VC31S4)#716267
- Positionality of Dumont--Thomas numeration systems for integers#160861
Record · ID 1129004
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