English
Related papers

Related papers: Fourier restriction and well-approximable numbers

200 papers

A new bound for the remainder term in the Taylor expansion of the complex exponent $e^{ix}$, $x\in\R$, is proved yielding precise moment-type estimates of the accuracy of the approximation of the characteristic function (the…

Probability · Mathematics 2018-04-02 Irina Shevtsova

In a recent paper the author obtained optimal bounds for the strong Gaussian approximation of sums of independent $\R^d$-valued random vectors with finite exponential moments. The results may be considered as generalizations of well-known…

Probability · Mathematics 2007-05-23 A. Yu. Zaitsev

We investigate some extremal problems in Fourier analysis and their connection to a problem in prime number theory. In particular, we improve the current bounds for the largest possible gap between consecutive primes assuming the Riemann…

Number Theory · Mathematics 2021-08-09 Emanuel Carneiro , Micah B. Milinovich , Kannan Soundararajan

The Sauer-Shelah-Perles Lemma is a cornerstone of combinatorics and learning theory, bounding the size of a binary hypothesis class in terms of its Vapnik-Chervonenkis (VC) dimension. For classes of functions over a $k$-ary alphabet, namely…

Machine Learning · Computer Science 2026-04-15 Steve Hanneke , Qinglin Meng , Shay Moran , Amirreza Shaeiri

In this article, we investigate large prime factors of Fourier coefficients of non-CM normalized cuspidal Hecke eigenforms in short intervals. One of the new ingredients involves deriving an explicit version of Chebotarev density theorem in…

Number Theory · Mathematics 2024-05-09 Sanoli Gun , Sunil Naik

We give an optimal version of the classical ``three-gap theorem'' on the fractional parts of $n \theta$, in the case where $\theta$ is an irrational number that is badly approximable. As a consequence, we deduce a version of Kronecker's…

Number Theory · Mathematics 2020-06-30 Dmitry Badziahin , Jeffrey Shallit

We consider Guth's approach to the Fourier restriction problem via polynomial partitioning. By writing out his induction argument as a recursive algorithm and introducing new geometric information, known as the polynomial Wolff axioms, we…

Classical Analysis and ODEs · Mathematics 2019-09-26 Jonathan Hickman , Keith M. Rogers

We compute the exact Fourier dimension of the set of $\Psi$-well-approximable $m \times n$ matrices (and the set of $\Psi$-well-approximable numbers) in the homogeneous and inhomogeneous cases for any approximation function $\Psi$…

Number Theory · Mathematics 2024-03-29 Thomas Cai , Kyle Hambrook

We prove a maximal restriction inequality for the Fourier transform, providing an answer to a question left open by M\"uller, Ricci and Wright. Our methods are similar to the ones in their article, with the addition of a suitable trick to…

Classical Analysis and ODEs · Mathematics 2018-10-17 João P. G. Ramos

We show, using a Knapp-type homogeneity argument, that the $(L^p, L^2)$ restriction theorem implies a growth condition on the hypersurface in question. We further use this result to show that the optimal $(L^p, L^2)$ restriction theorem…

Classical Analysis and ODEs · Mathematics 2007-05-23 Alex Iosevich

Let $\mathbb{H}$ be a $(d-1)$-dimensonal hyperbolic paraboloid in $\mathbb{R}^d$ and let $Ef$ be the Fourier extension operator associated to $\mathbb{H},$ with $f$ supported in $B^{d-1}(0,2)$. We prove that $\|Ef\|_{L^p (B(0,R))} \leq…

Classical Analysis and ODEs · Mathematics 2021-11-03 Alex Barron

A pair of probability distributions over $\{0,1\}^n$ is said to be $(k,\delta)$-wise indistinguishable if all of the size $k$ marginals are within statistical distance at most $\delta$. Previous works introduced this concept and study when…

Computational Complexity · Computer Science 2026-05-14 Christopher Williamson

By combining the planebrush argument of Katz and Zahl \cite{katz21} with the decoupling-incidence method of Wang and Wu \cite{WangWu2024}, we derive new bounds for the Fourier restriction problem and the Bochner--Riesz problem, extending…

Classical Analysis and ODEs · Mathematics 2025-12-01 Tainara Borges , Tiklung Chan , Mingfeng Chen , Diankun Liu , Yakun Xi , Yufei Zhan

We derive refined entropy upper bounds for $q$-ary $B_2$ codes by exploiting the Fourier structure of the i.i.d. difference distribution $D=X-Y$. Since the pmf of $D$ is an autocorrelation, its Fourier series is a nonnegative trigonometric…

Information Theory · Computer Science 2026-04-01 Stefano Della Fiore

For any integers $d, n \geq 2$ and $1/({\min\{n,d\}})^{0.4999} < \varepsilon<1$, we show the existence of a set of $n$ vectors $X\subset \mathbb{R}^d$ such that any embedding $f:X\rightarrow \mathbb{R}^m$ satisfying $$ \forall x,y\in X,\…

Information Theory · Computer Science 2017-11-10 Kasper Green Larsen , Jelani Nelson

We prove that the Hausdorff dimension of the set $\mathbf{x}\in [0,1)^d$, such that $$ \left|\sum_{n=1}^N \exp\left(2 \pi i\left(x_1n+\ldots+x_d n^d\right)\right) \right|\ge c N^{1/2} $$ holds for infinitely many natural numbers $N$, is at…

Number Theory · Mathematics 2020-12-16 Changhao Chen , Bryce Kerr , Igor Shparlinski

For $0<\alpha<1$ let $V(\alpha)$ denote the supremum of the numbers $v$ such that every $\alpha$-H\"older continuous function is of bounded variation on a set of Hausdorff dimension $v$. Kahane and Katznelson (2009) proved the estimate $1/2…

Probability · Mathematics 2016-11-29 Omer Angel , Richárd Balka , András Máthé , Yuval Peres

Given an open and bounded set $\Omega\subset\mathbb{R}^N$, we consider the problem of minimizing the ratio between the $s-$perimeter and the $N-$dimensional Lebesgue measure among subsets of $\Omega$. This is the nonlocal version of the…

Analysis of PDEs · Mathematics 2013-11-21 Lorenzo Brasco , Erik Lindgren , Enea Parini

A matrix $A \in \mathbb{C}^{q \times N}$ satisfies the restricted isometry property of order $k$ with constant $\varepsilon$ if it preserves the $\ell_2$ norm of all $k$-sparse vectors up to a factor of $1\pm \varepsilon$. We prove that a…

Data Structures and Algorithms · Computer Science 2015-10-14 Ishay Haviv , Oded Regev

Let $A$ be an $N \times N$ Fourier matrix over $\mathbb{F}_p^{\log{N}/\log{p}}$ for some prime $p$. We improve upon known lower bounds for the number of rows of $A$ that must be sampled so that the resulting matrix $M$ satisfies the…

Information Theory · Computer Science 2019-03-29 Shravas Rao
‹ Prev 1 3 4 5 6 7 10 Next ›