The first 128 digits of an autoconvolution inequality
Number Theory
2026-02-10 v1 Combinatorics
Abstract
Using rigorous high-precision floating point arithmetic we compute very tight rigorous bounds on the auto-convolution constant where the infimum is taken over all unit mass functions . This quantity arises in additive combinatorics, particularly in the study of Sidon sets. Our bounds give the first 128 digits of , and so substantially improve previous bounds on this quantity due to White, Green, and Martin & O'Bryant.
Keywords
Cite
@article{arxiv.2602.07292,
title = {The first 128 digits of an autoconvolution inequality},
author = {Andrew Rechnitzer},
journal= {arXiv preprint arXiv:2602.07292},
year = {2026}
}
Comments
28 pages, 7 figures,