Home
Hostname: page-component-684bc48f8b-plp5r Total loading time: 0.929 Render date: 2021-04-12T02:09:35.273Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false, "newCitedByModal": true }

# EXTENSIONS OF AUTOCORRELATION INEQUALITIES WITH APPLICATIONS TO ADDITIVE COMBINATORICS

Published online by Cambridge University Press:  08 April 2020

Corresponding

## Abstract

Barnard and Steinerberger [‘Three convolution inequalities on the real line with connections to additive combinatorics’, Preprint, 2019, arXiv:1903.08731] established the autocorrelation inequality

$$\begin{eqnarray}\min _{0\leq t\leq 1}\int _{\mathbb{R}}f(x)f(x+t)\,dx\leq 0.411||f||_{L^{1}}^{2}\quad \text{for}~f\in L^{1}(\mathbf{R}),\end{eqnarray}$$
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. We show that for $f$ to be extremal for this inequality, we must have
$$\begin{eqnarray}\max _{x_{1}\in \mathbb{R}}\min _{0\leq t\leq 1}\left[f(x_{1}-t)+f(x_{1}+t)\right]\leq \min _{x_{2}\in \mathbb{R}}\max _{0\leq t\leq 1}\left[f(x_{2}-t)+f(x_{2}+t)\right].\end{eqnarray}$$
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,n\in \mathbb{Z}^{+}$ , $f\in L^{1}$ , $A$ be a $d\times n$ matrix with real entries and columns $a_{i}$ for $1\leq i\leq n$ and $C$ be a constant. For a broad class of matrices $A$ , we prove necessary conditions for $f$ to extremise autocorrelation inequalities of the form
$$\begin{eqnarray}\min _{\mathbf{t}\in [0,1]^{d}}\int _{\mathbb{R}}\mathop{\prod }_{i=1}^{n}~f(x+\mathbf{t}\cdot a_{i})\,dx\leq C||f||_{L^{1}}^{n}.\end{eqnarray}$$

## MSC classification

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , December 2020 , pp. 451 - 461
© 2020 Australian Mathematical Publishing Association Inc.

## Access options

Get access to the full version of this content by using one of the access options below.

## Footnotes

This work was supported by NSF grants DMS1659037 and DMS1561945, Wake Forest University and Williams College.

## References

Barnard, R. and Steinerberger, S., ‘Three convolution inequalities on the real line with connections to additive combinatorics’, J. Number Theory 207 (2020), 4255.10.1016/j.jnt.2019.07.001CrossRefGoogle Scholar
Bennett, J., Carbery, A., Christ, M. and Tao, T., ‘The Brascamp–Lieb inequalities: finiteness, structure and extremals’, Geom. Funct. Anal. 17 (2005), 13431415.10.1007/s00039-007-0619-6CrossRefGoogle Scholar
Bernstheyn, A. and Tait, M., ‘Improved lower bound for difference bases’, J. Number Theory 205 (2020), 5058.10.1016/j.jnt.2019.05.002CrossRefGoogle Scholar
Bollobas, B., The Art of Mathematics: Coffee Time in Memphis (Cambridge University Press, Cambridge, 2006).10.1017/CBO9780511816574CrossRefGoogle Scholar
Dong, Z., Li, J. and Li, W., ‘A note on distribution-free symmetrization inequalities’, J. Theoret. Probab. 28(3) (2015), 958967.10.1007/s10959-014-0538-zCrossRefGoogle Scholar
Erdős, P. and Gal, I., ‘On the representation of 1, 2, …, N by differences’, Nederl. Akad. Wetensch. Proc. 51 (1948), 11551158.Google Scholar
Golay, M. J. E., ‘Notes on the representation of 1, 2, …, N by differences’, J. Lond. Math. Soc. (2) 4(4) (1972), 729734.10.1112/jlms/s2-4.4.729CrossRefGoogle Scholar
Haselgrove, C. and Leech, J., ‘Note on restricted difference bases’, J. Lond. Math. Soc. (2) 32 (1957), 228231.10.1112/jlms/s1-32.2.228CrossRefGoogle Scholar
Leech, J., ‘On the representation of 1, 2, …, n by differences’, J. Lond. Math. Soc. (2) 31 (1956), 160169.10.1112/jlms/s1-31.2.160CrossRefGoogle Scholar
Martin, G. and O’Bryant, K., ‘The symmetric subset problem in continuous Ramsey theory’, Exp. Math. 16(2) (2007), 145166.10.1080/10586458.2007.10128993CrossRefGoogle Scholar
Pott, A., Kumaran, V., Helleseth, T. and Jungnickel, D., Difference Sets, Sequences and Their Correlation Properties, NATO Science Series C, 542 (Springer, Dordrecht, 2012).Google Scholar

### Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 27 *
View data table for this chart

* Views captured on Cambridge Core between 08th April 2020 - 12th April 2021. This data will be updated every 24 hours.

# Send article to Kindle

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

EXTENSIONS OF AUTOCORRELATION INEQUALITIES WITH APPLICATIONS TO ADDITIVE COMBINATORICS
Available formats
×

# Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

EXTENSIONS OF AUTOCORRELATION INEQUALITIES WITH APPLICATIONS TO ADDITIVE COMBINATORICS
Available formats
×

# Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

EXTENSIONS OF AUTOCORRELATION INEQUALITIES WITH APPLICATIONS TO ADDITIVE COMBINATORICS
Available formats
×
×