Almost Beatty partitions

From MaRDI portal
Publication:5226858

zbMATH Open1418.11044arXiv1809.08690MaRDI QIDQ5226858FDOQ5226858


Authors: Xiao-Min Li, Junxian Li, Yun Xie, Adolf Hildebrand Edit this on Wikidata


Publication date: 2 August 2019

Abstract: Given 0<alpha<1, the Beatty sequence of density alpha is the sequence Balpha=(lfloorn/alphafloor)ninmathbbN. Beatty's theorem states that if are irrational numbers with , then the Beatty sequences Balpha 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 first characterize all cases in which there exists a partition into two exact Beatty sequences and one almost Beatty sequence with given densities, and we determine the approximation error involved. We then give two general constructions that yield partitions into one exact Beatty sequence and two almost Beatty sequences with prescribed densities, and we determine the approximation error in these constructions. Finally, we show that in many situations these constructions are best-possible in the sense that they yield the closest approximation to a three-part Beatty partition.


Full work available at URL: https://arxiv.org/abs/1809.08690

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations




Cites Work


Cited In (8)

Uses Software





This page was built for publication: Almost Beatty partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5226858)