Skip to content
DraconiticResearch
Search Sources API
197,785 studies31 sourcesUpdated 23 min ago
PreprintCC BY-NC-SA 4.0arXiv

A Sharp Bound for Additive Complements

Abstract

Let A and B be infinite sets of nonnegative integers whose sum contains all sufficiently large integers, and let A(x) and B(x) be their counting functions. We give a discrete proof of the sharp implication limsupx→∞A(x)B(x)/x<3/2 Longrightarrow A(x)B(x)−x⟶+∞. The constant 3/2 is best possible. Using finite convolution sums, we show that a long gap in one set forces a gap in the other. We then compare the counting functions before and after the gap to obtain the sharp bound.

Related

  1. A lower bound for additive complements to the primes
    Artyom Radomskii
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  2. On additive complements in natural numbers
    Quan-Hui Yang, Lilu Zhao
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  3. On almost perfect additive complements
    Wouter van Doorn, Boning Liu, Quanyu Tang
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  4. On a problem of Ma and Chen concerning minimal additive complements
    Shi-Qiang Chen, Quan-Hui Yang
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  5. Halving the original Kalton--Roberts upper bound for nearly additive set functions
    Boon Suan Ho, Tomasz Kania
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
BibTeX
@misc{zhang2026sharp,
  title = {{A Sharp Bound for Additive Complements}},
  author = {Zihan Zhang},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.29963},
  eprint = {2610.29963},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.29963},
  note = {CC BY-NC-SA 4.0},
}
RIS
TY  - UNPB
TI  - A Sharp Bound for Additive Complements
AU  - Zihan Zhang
PY  - 2026
DA  - 2026/10/21
PB  - arXiv
DO  - 10.48550/arxiv.2610.29963
UR  - https://arxiv.org/abs/2610.29963
AB  - Let A and B be infinite sets of nonnegative integers whose sum contains all sufficiently large integers, and let A(x) and B(x) be their counting functions. We give a discrete proof of the sharp implication limsup_x→∞A(x)B(x)/x<3/2 Longrightarrow A(x)B(x)−x⟶+∞. The constant 3/2 is best possible. Using finite convolution sums, we show that a long gap in one set forces a gap in the other. We then compare the counting functions before and after the gap to obtain the sharp bound.
ER  -