skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: A higher dimensional Bourgain-Dyatlov fractal uncertainty principle
We establish a version of the fractal uncertainty principle, obtained by Bourgain and Dyatlov in 2016, in higher dimensions. The Fourier support is limited to sets Y⊂ℝd which can be covered by finitely many products of δ-regular sets in one dimension, but relative to arbitrary axes. Our results remain true if Y is distorted by diffeomorphisms. Our method combines the original approach by Bourgain and Dyatlov, in the more quantitative 2017 rendition by Jin and Zhang, with Cartan set techniques.  more » « less
Award ID(s):
1800689
PAR ID:
10105661
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Analysis & PDE
ISSN:
2157-5045
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract For every $$\beta \in (0,\infty )$$ β ∈ ( 0 , ∞ ) , $$\beta \ne 1$$ β ≠ 1 , we prove that a positive measure subset A of the unit square contains a point $$(x_0,y_0)$$ ( x 0 , y 0 ) such that A nontrivially intersects curves $$y-y_0 = a (x-x_0)^\beta $$ y - y 0 = a ( x - x 0 ) β for a whole interval $$I\subseteq (0,\infty )$$ I ⊆ ( 0 , ∞ ) of parameters $$a\in I$$ a ∈ I . A classical Nikodym set counterexample prevents one to take $$\beta =1$$ β = 1 , which is the case of straight lines. Moreover, for a planar set A of positive density, we show that the interval I can be arbitrarily large on the logarithmic scale. These results can be thought of as Bourgain-style large-set variants of a recent continuous-parameter Sárközy-type theorem by Kuca, Orponen, and Sahlsten. 
    more » « less
  2. null (Ed.)
    Abstract We consider separable 2D discrete Schrödinger operators generated by 1D almost Mathieu operators. For fixed Diophantine frequencies, we prove that for sufficiently small couplings the spectrum must be an interval. This complements a result by J. Bourgain establishing that for fixed couplings the spectrum has gaps for some (positive measure) Diophantine frequencies. Our result generalizes to separable multidimensional discrete Schrödinger operators generated by 1D quasiperiodic operators whose potential is analytic and whose frequency is Diophantine. The proof is based on the study of the thickness of the spectrum of the almost Mathieu operator and utilizes the Newhouse Gap Lemma on sums of Cantor sets. 
    more » « less
  3. null (Ed.)
    Abstract A set $$U \subseteq {\mathbb {R}} \times {\mathbb {R}}$$ is universal for countable subsets of $${\mathbb {R}}$$ if and only if for all $$x \in {\mathbb {R}}$$ , the section $$U_x = \{y \in {\mathbb {R}} : U(x,y)\}$$ is countable and for all countable sets $$A \subseteq {\mathbb {R}}$$ , there is an $$x \in {\mathbb {R}}$$ so that $$U_x = A$$ . Define the equivalence relation $$E_U$$ on $${\mathbb {R}}$$ by $$x_0 \ E_U \ x_1$$ if and only if $$U_{x_0} = U_{x_1}$$ , which is the equivalence of codes for countable sets of reals according to U . The Friedman–Stanley jump, $=^+$ , of the equality relation takes the form $$E_{U^*}$$ where $U^*$ is the most natural Borel set that is universal for countable sets. The main result is that $=^+$ and $$E_U$$ for any U that is Borel and universal for countable sets are equivalent up to Borel bireducibility. For all U that are Borel and universal for countable sets, $$E_U$$ is Borel bireducible to $=^+$ . If one assumes a particular instance of $$\mathbf {\Sigma }_3^1$$ -generic absoluteness, then for all $$U \subseteq {\mathbb {R}} \times {\mathbb {R}}$$ that are $$\mathbf {\Sigma }_1^1$$ (continuous images of Borel sets) and universal for countable sets, there is a Borel reduction of $=^+$ into $$E_U$$ . 
    more » « less
  4. Abstract We asymptotically estimate the variance of the number of lattice points in a thin, randomly rotated annulus lying on the surface of the sphere. This partially resolves a conjecture of Bourgain, Rudnick, and Sarnak. We also obtain estimates that are valid for all balls and annuli that are not too small. Our results have several consequences: for a conjecture of Linnik on sums of two squares and a “microsquare”, a conjecture of Bourgain and Rudnick on the number of lattice points lying in small balls on the surface of the sphere, the covering radius of the sphere, and the distribution of lattice points in almost all thin regions lying on the surface of the sphere. Finally, we show that for a density 1. subsequence of squarefree integers, the variance exhibits a different asymptotic behaviour for balls of volume with . We also obtain analogous results for Heegner points and closed geodesics. Interestingly, we are able to prove some slightly stronger results for closed geodesics than for Heegner points or lattice points on the surface of the sphere. A crucial observation that underpins our proof is the different behaviour of weighting functions for annuli and for balls. © 2022 Courant Institute of Mathematics and Wiley Periodicals LLC. 
    more » « less
  5. Suppose Alice and Bob each start with private randomness and no other input, and they wish to engage in a protocol in which Alice ends up with a set x ⊆ [ n ] and Bob ends up with a set y ⊆ [ n ], such that ( x , y ) is uniformly distributed over all pairs of disjoint sets. We prove that for some constant β < 1, this requires Ω ( n ) communication even to get within statistical distance 1− β n of the target distribution. Previously, Ambainis, Schulman, Ta-Shma, Vazirani, and Wigderson (FOCS 1998) proved that Ω (√ n ) communication is required to get within some constant statistical distance ɛ > 0 of the uniform distribution over all pairs of disjoint sets of size √ n . 
    more » « less