The Ostrowski Expansions Revealed
Avraham Bourla
TL;DR
This paper introduces algorithms for computing the Ostrowski expansions of real numbers, including absolute and alternating forms, and proves their uniqueness, advancing the understanding of these number representations.
Contribution
It presents new algorithms for Ostrowski expansions and establishes their uniqueness, filling gaps in the computational and theoretical understanding.
Findings
Algorithms for absolute Ostrowski expansions
Algorithms for alternating Ostrowski expansions
Proofs of uniqueness for these expansions
Abstract
We provide algorithms for the absolute and alternating Ostrowski Expansions of the continuum and provide proofs for their uniqueness.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Logic, programming, and type systems · Computability, Logic, AI Algorithms