Generalized difference sets and autocorrelation integrals

DOI10.4064/AA200903-12-1zbMATH Open1475.05015arXiv2004.06611OpenAlexW3138655353WikidataQ114022081 ScholiaQ114022081MaRDI QIDQ5156876FDOQ5156876

Authors: Noah Kravitz 

Publication date: 12 October 2021

Published in: Acta Arithmetica (Search for Journal in Brave)

Abstract: In 2010, Cilleruelo, Ruzsa, and Vinuesa established a surprising connection between the maximum possible size of a generalized Sidon set in the first $N$ natural numbers and the optimal constant in an ``analogous problem concerning nonnegative-valued functions on $[0,1]$ with autoconvolution integral uniformly bounded above. Answering a recent question of Barnard and Steinerberger, we prove the corresponding dual result about the minimum size of a so-called generalized difference set that covers the first $N$ natural numbers and the optimal constant in an analogous problem concerning nonnegative-valued functions on $mathbbR$ with autocorrelation integral bounded below on $[0,1]$. These results show that the correspondence of Cilleruelo, Ruzsa, and Vinuesa is representative of a more general phenomenon relating discrete problems in additive combinatorics to questions in the continuous world.

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

Recommendations

• Constructions of generalized Sidon sets.
• Popular differences and generalized Sidon sets
• scientific article; zbMATH DE number 5130028
• Generalized Sidon sets
• On generalized perfect difference sets constructed from Sidon sets

zbMATH Keywords

autocorrelationadditive combinatoricsgeneralized difference set

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Inequalities for sums, series and integrals (26D15) Convolution, factorization for one variable harmonic analysis (42A85) Representation functions (11B34) Inverse problems of additive number theory, including sumsets (11P70)

Cites Work

• Additive combinatorics
• On Additive Bases and Harmonious Graphs
• The number of squares and \(B_h[g]\) sets
• Notes on the Representation of 1,2, ……, N by differences
• ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS
• Constructions of generalized Sidon sets.
• Comparison of L¹- and L^∞-norms of squares of polynomials
• On symmetric intersecting families
• On suprema of autoconvolutions with an application to Sidon sets
• Upper and lower bounds for finite \(B_h[g]\) sequences.
• Generalized Sidon sets
• Improved bounds on the supremum of autoconvolutions
• Generalized relative difference sets and partially balanced incomplete block designs
• On the Representation of 1, 2, …, n by Differences
• Title not available (Why is that?)
• The density of \(B_ h[g]\) sequences and the minimum of dense cosine sums
• Improved lower bound for difference bases
• Three convolution inequalities on the real line with connections to additive combinatorics
• On optimal autocorrelation inequalities on the real line

Cited In (7)

• Convolution and generalized difference sets
• Three convolution inequalities on the real line with connections to additive combinatorics
• The smoothest average: Dirichlet, Fejér and Chebyshev
• Difference system for Selberg correlation integrals
• Two applications of relative difference sets: difference triangles and negaperiodic autocorrelation functions
• Extensions of autocorrelation inequalities with applications to additive combinatorics
• On suprema of autoconvolutions with an application to Sidon sets

This page was built for publication: Generalized difference sets and autocorrelation integrals

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