Extensions of autocorrelation inequalities with applications to additive combinatorics

DOI10.1017/S000497272000026XMaRDI QIDQ5138959zbMATH OpenOpenAlexFDO

Authors Sara Fish, Dylan A. King, Steven J. Miller

Publication date 4 December 2020

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

autocorrelationintegral inequality

Mathematics Subject Classification ID

Inequalities involving derivatives and differential and integral operators (26D10) Functional inequalities, including subadditivity, convexity, etc. (39B62)

Abstract: In a 2019 paper, Barnard and Steinerberger show that for $fin{L}^1(mathbfR)$, the following autocorrelation inequality holds: �egin{equation*} min_{0 leq t leq 1} int_mathbf{R} f(x) f(x+t) mathrm{d}x leq 0.411 ||f||_{L^1}^2, end{equation*} where the constant $0.411$ cannot be replaced by $0.37$. In addition to being interesting and important in their own right, inequalities such as these have applications in additive combinatorics where some problems, such as those of minimal difference basis, can be encapsulated by a convolution inequality similar to the above integral. Barnard and Steinerberger suggest that future research may focus on the existence of functions extremizing the above inequality (which is itself related to Brascamp-Lieb type inequalities). We show that for $f$ to be extremal under the above, we must have �egin{equation*} max_{x_1 in mathbf{R} }min_{0 leq t leq 1} left[ f(x_1-t)+f(x_1+t) ight] leq min_{x_2 in mathbf{R} } max_{0 leq t leq 1} left[ f(x_2-t)+f(x_2+t) ight] . end{equation*} Our central technique for deriving this result is local perturbation of $f$ to increase the value of the autocorrelation, while leaving $||f|{|}_{L^1}$ unchanged. These perturbation methods can be extended to examine a more general notion of autocorrelation. Let $d,ninmathbb{Z}^{+}$, $fin{L}^1$, $A$ be a $dimesn$ matrix with real entries and columns $a_i$ for $1leqileqn$, and $C$ be a constant. For a broad class of matrices $A$, we prove necessary conditions for $f$ to extremize autocorrelation inequalities of the form �egin{equation*} min_{ mathbf{t} in [0,1]^d } int_{mathbf{R}} prod_{i=1}^n f(x+ mathbf{t} cdot a_i) mathrm{d}x leq C ||f||_{L^1}^n. end{equation*}

Recommendations

• On optimal autocorrelation inequalities on the real line
• scientific article; zbMATH DE number 1739763
• On suprema of autoconvolutions with an application to Sidon sets
• Generalized difference sets and autocorrelation integrals
• The supremum of autoconvolutions, with applications to additive number theory

Cites work

• A note on distribution-free symmetrization inequalities
• scientific article; zbMATH DE number 5066400 (Why is no real title available?)
• scientific article; zbMATH DE number 3049251 (Why is no real title available?)
• Improved lower bound for difference bases
• Note on Restricted Difference Bases
• Notes on the Representation of 1,2, ……, N by differences
• On the Representation of 1, 2, …, n by Differences
• The Brascamp-Lieb inequalities: Finiteness, structure and extremals
• The Symmetric Subset Problem in Continuous Ramsey Theory
• Three convolution inequalities on the real line with connections to additive combinatorics

Cited in

(3)

• On optimal autocorrelation inequalities on the real line
• scientific article; zbMATH DE number 1739763 (Why is no real title available?)
• Some new inequalities in additive combinatorics

This page was built for publication: Extensions of autocorrelation inequalities with applications to additive combinatorics

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