Three Convolution Inequalities on the Real Line with Connections to Additive Combinatorics

Abstract

We discuss three convolution inequalities that are connected to additive combinatorics. Cloninger and the second author showed that for nonnegative f ∈ L1(-1/4, 1/4), -1/2 ≤ t ≤ 1/2 ∫Rf(t-x) f(x) dx ≥ 1.28 ( ∫-1/41/4f(x) dx)2 which is related to g-Sidon sets (1.28 cannot be replaced by 1.52). We prove a dual statement, related to difference bases, and show that for f ∈ L1(R), 0 ≤ t ≤ 1∫Rf(x) f(x+t) dx ≤ 0.42 \|f\|L12, where the constant 1/2 is trivial, 0.42 cannot be replaced by 0.37. This suggests a natural conjecture about the asymptotic structure of g-difference bases. Finally, we show for all functions f ∈ L1(R) L2(R), ∫-1212 ∫Rf(x) f(x+t) dxdt ≤ 0.91 \|f\|L1\|f\|L2

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…