Papers
Topics
Authors
Recent
Search
2000 character limit reached

Inequalities in Fourier analysis on binary cubes

Published 2 Jul 2025 in math.CA, cs.IT, math.CO, and math.IT | (2507.01359v1)

Abstract: This paper studies two classical inequalities, namely the Hausdorff-Young inequality and equal-exponent Young's convolution inequality, for discrete functions supported in the binary cube ${0,1}d\subset\mathbb{Z}d$. We characterize the exact ranges of Lebesgue exponents in which sharp versions of these two inequalities hold, and present several immediate consequences. First, if the functions are specialized to be the indicator of some set $A\subseteq{0,1}d$, then we obtain sharp upper bounds on two types of generalized additive energies of $A$, extending the works of Kane-Tao, de Dios Pont-Greenfeld-Ivanisvili-Madrid, and one of the present authors. Second, we obtain a sharp binary variant of the Beckner-Hirschman entropic uncertainty principle, as well as a sharp lower estimate on the entropy of a sum of two independent random variables with values in ${0,1}d$. Finally, the sharp binary Hausdorff-Young inequality also reveals the exact range of dimension-free estimates for the Fourier restriction to the binary cube.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.