Almost Beatty Partitions
A.J. Hildebrand, Junxian Li, Xiaomin Li, Yun Xie

TL;DR
This paper explores how to approximate three-part Beatty partitions using exact and almost Beatty sequences, characterizing when such near-partitions are possible and establishing their optimality.
Contribution
It characterizes conditions for near-partitions with two exact and one almost Beatty sequence, providing constructions and proving their optimality.
Findings
Characterized when two exact and one almost Beatty sequence form a partition.
Provided explicit constructions for near-partitions with prescribed densities.
Proved the optimality of these constructions in approximating three-part Beatty partitions.
Abstract
Given , the Beatty sequence of density is the sequence . Beatty's theorem states that if are irrational numbers with , then the Beatty sequences and partition the positive integers, that is, each positive integer belongs to exactly one of these two sequences. On the other hand, Uspensky showed that this result breaks down completely for partitions into three (or more) sequences: There does not exist a single triple such that the Beatty sequences partition the positive integers. In this paper we consider the question of how close we can come to a three-part Beatty partition by considering "almost" Beatty sequences, that is, sequences that represent small perturbations of an "exact" Beatty sequence. We…
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
TopicsMathematical Approximation and Integration · Digital Image Processing Techniques · Analytic Number Theory Research
