The first 128 digits of an autoconvolution inequality

Abstract

Using rigorous high-precision floating point arithmetic we compute very tight rigorous bounds on the auto-convolution constant \[ 22 = ∈ff \|f f\|22 = ∈ff ∫-11 (f f)2 \] where the infimum is taken over all unit mass functions f ∈ L1(-1/2,1/2). This quantity arises in additive combinatorics, particularly in the study of Sidon sets. Our bounds give the first 128 digits of 22, and so substantially improve previous bounds on this quantity due to White, Green, and Martin & O'Bryant.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…