English
Related papers

Related papers: Fourier restriction and well-approximable numbers

200 papers

We prove that the finite field Fourier extension operator for the paraboloid is bounded from $L^2\to L^r$ for $r\geq \frac{2d+4}{d}$ in even dimensions $d\ge 8$, which is the optimal $L^2$ estimate. For $d=6$ we obtain the optimal range $r>…

Classical Analysis and ODEs · Mathematics 2017-12-18 Alex Iosevich , Doowon Koh , Mark Lewko

In this paper we prove almost sure local well-posedness in both atomic spaces $X^s$ and Fourier restriction spaces $X^{s, b}$ for the cubic nonlinear Schr\"odinger equation on $\TTT^d$ ($d\geq 3$) in the super-critical regime.

Analysis of PDEs · Mathematics 2018-08-03 Haitian Yue

Several problems on Fourier series and trigonometric approximation on a hexagon and a triangle are studied. The results include Abel and Ces\`aro summability of Fourier series, degree of approximation and best approximation by trigonometric…

Classical Analysis and ODEs · Mathematics 2008-02-05 Yuan Xu

Given vectors $v_1,\dots,v_n\in\mathbb{R}^d$ and a matroid $M=([n],I)$, we study the problem of finding a basis $S$ of $M$ such that $\det(\sum_{i \in S}v_i v_i^\top)$ is maximized. This problem appears in a diverse set of areas such as…

Data Structures and Algorithms · Computer Science 2020-04-20 Vivek Madan , Aleksandar Nikolov , Mohit Singh , Uthaipon Tantipongpipat

The study of Fourier transforms of probability measures on fractal sets plays an important role in recent research. Faster decay rates are known to yield enhanced results in areas such as metric number theory. This paper focuses on…

Classical Analysis and ODEs · Mathematics 2024-12-24 Ying Wai Lee

We present a short and elementary proof of the Ajtai-Koml\'os-Tusn\'ady (AKT) optimal matching theorem in dimension 2 via Fourier analysis and a smoothing argument. The upper bound applies to more general families of samples, including…

Probability · Mathematics 2019-09-16 Sergey Bobkov , Michel Ledoux

For a fixed linear-model basis, we show that the $A$ criterion factors into an inverse-$D$ scale term and a dimensionless sphericity factor that depends only on eigenvalue dispersion. This factor isolates exactly the part of $A$ not…

Methodology · Statistics 2026-03-12 Andrew T. Karl , Bradley Jones

The purpose of this note is to discuss several results that have been obtained in the last decade in the context of sharp adjoint Fourier restriction/Strichartz inequalities. Rather than aiming at full generality, we focus on several…

Classical Analysis and ODEs · Mathematics 2017-01-25 Damiano Foschi , Diogo Oliveira e Silva

We study the Fourier spectrum of functions $f\colon \{0,1\}^{mk} \to \{-1,0,1\}$ which can be written as a product of $k$ Boolean functions $f_i$ on disjoint $m$-bit inputs. We prove that for every positive integer $d$, \[ \sum_{S \subseteq…

Computational Complexity · Computer Science 2019-02-08 Chin Ho Lee

Let $k$ be a field, $V$ a $k$-vector space and $X$ be a subset of $V $. A function $f:X\to k$ is weakly polynomial of degree $\leq a$, if the restriction of $f$ on any affine subspace $L\subset X$ is a polynomial of degree $\leq a$. In this…

Algebraic Geometry · Mathematics 2019-02-06 David Kazhdan , Tamar Ziegler

In 1935, Erd\H{o}s proved that the sums $f_k=\sum_n 1/(n\log n)$, over integers $n$ with exactly $k$ prime factors, are bounded by an absolute constant, and in 1993 Zhang proved that $f_k$ is maximized by the prime sum $f_1=\sum_p 1/(p\log…

Number Theory · Mathematics 2024-12-02 Ofir Gorodetsky , Jared Duker Lichtman , Mo Dick Wong

We prove new Fourier restriction estimates to the unit sphere $S^{d-1}$ on the class of $O(d-k)\times O(k)$-symmetric functions, for every $d\geq 4$ and $2\leq k\leq d-2$. As an application, we establish the existence of maximizers for the…

Functional Analysis · Mathematics 2023-11-08 Rainer Mandel , Diogo Oliveira e Silva

We establish the existence of extremizers for a Fourier restriction inequality on planar convex arcs without points with colinear tangents whose curvature satisfies a natural assumption. More generally, we prove that any extremizing…

Classical Analysis and ODEs · Mathematics 2012-10-03 Diogo Oliveira e Silva

We calculate the least upper bounds for approximations in the metric of the space $L_2$ by linear methods of summation of Fourier series on classes of periodic functions $L^\psi_{\bar\beta,1}$ defined by sequences of multipliers…

Classical Analysis and ODEs · Mathematics 2013-03-07 A. S. Serdyuk , I. V. Sokolenko

Budget feasible mechanisms, recently initiated by Singer (FOCS 2010), extend algorithmic mechanism design problems to a realistic setting with a budget constraint. We consider the problem of designing truthful budget feasible mechanisms for…

Computer Science and Game Theory · Computer Science 2010-07-23 Ning Chen , Nick Gravin , Pinyan Lu

We consider the question of the largest possible combinatorial diameter among $(d-1)$-dimensional simplicial complexes on $n$ vertices, denoted $H_s(n, d)$. Using a probabilistic construction we give a new lower bound on $H_s(n, d)$ that is…

Combinatorics · Mathematics 2019-06-03 Francisco Criado , Andrew Newman

Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…

Metric Geometry · Mathematics 2022-03-23 Brett Leroux , Luis Rademacher

Let $d\geq 2$ be an integer and let $2d/(d-1) < q \leq \infty$. In this paper we investigate the sharp form of the mixed norm Fourier extension inequality \begin{equation*} \big\|\widehat{f\sigma}\big\|_{L^q_{{\rm rad}}L^2_{{\rm…

Classical Analysis and ODEs · Mathematics 2021-09-30 Emanuel Carneiro , Diogo Oliveira e Silva , Mateus Sousa

Let $\bf f$ be a primitive Hilbert cusp form of weight $k$ and level $\mathfrak{n}$ with Fourier coefficients $c_{\bf f}(\mathfrak{m})$. We prove a non-trivial upper bound for almost all Fourier coefficients $c_{\bf f}(\mathfrak{m})$ of…

Number Theory · Mathematics 2020-10-09 Balesh Kumar

The dispersion of a point set $P\subset[0,1]^d$ is the volume of the largest box with sides parallel to the coordinate axes, which does not intersect $P$. Here, we show a construction of low-dispersion point sets, which can be deduced from…

Computational Complexity · Computer Science 2024-12-20 Mario Ullrich , Jan Vybíral