A variant of Ostrowski numeration
Emmanuel Cabanillas

TL;DR
This paper introduces a new variant of Ostrowski numeration that codes both integers and reals in [0,1[ with sequences preserving order, facilitating proofs of properties of Kronecker sequences.
Contribution
It proposes a novel Ostrowski numeration variant that codes integers and reals uniformly, maintaining order relations, and aids in analyzing Kronecker sequence properties.
Findings
Codes integers and reals with the same sequence for n and {nα}
Sequences respect natural lexicographic order
Supports proofs of order properties of Kronecker sequences
Abstract
In this article, we propose a variant of the usual Ostrowski -numeration (where is a real in [0, 1[) that codes integers (positive as well as negative) and reals of [0, 1[ (instead of [--, 1--[), so that for every integer n, n and {n} have the same coding sequence. These coding sequences respect natural lexicographic orders and will be used to prove well known results on order properties of Kronecker sequences ({n -- }) n .
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
TopicsComputability, Logic, AI Algorithms · Advanced Mathematical Theories and Applications · Advanced Mathematical Theories
