English
Related papers

Related papers: An optimal uncertainty principle in twelve dimensi…

200 papers

In this paper we prove that there exists a constant $C$ such that, if $S,\Sigma$ are subsets of $\R^d$ of finite measure, then for every function $f\in L^2(\R^d)$, $$\int_{\R^d}|f(x)|^2 dx \leq C e^{C \min(|S||\Sigma|, |S|^{1/d}w(\Sigma),…

Classical Analysis and ODEs · Mathematics 2007-07-11 Philippe Jaming

It is well known that there is an absolute constant $\mathfrak{C}>0$ such that if the Laplace transform $G(s)=\int_{0}^{\infty}\rho(x)e^{-s x}\:\mathrm{d}x$ of a bounded function $\rho$ has analytic continuation through every point of the…

Classical Analysis and ODEs · Mathematics 2019-08-20 Gregory Debruyne , Jasson Vindas

The vertices of the integer hull are the integral equivalent to the well-studied basic feasible solutions of linear programs. In this paper we give new bounds on the number of non-zero components -- their support -- of these vertices…

Data Structures and Algorithms · Computer Science 2020-06-22 Sebastian Berndt , Klaus Jansen , Kim-Manuel Klein

We give an elementary proof of a generalization of Bourgain and Tzafriri's Restricted Invertibility Theorem, which says roughly that any matrix with columns of unit length and bounded operator norm has a large coordinate subspace on which…

Functional Analysis · Mathematics 2010-10-05 Daniel A. Spielman , Nikhil Srivastava

The distinction between conditional, unconditional, and absolute convergence in infinite-dimensional spaces has fundamental implications for computational algorithms. While these concepts coincide in finite dimensions, the Dvoretzky-Rogers…

Computation and Language · Computer Science 2026-01-14 Przemysław Spyra

We refer to the distance between optimal solutions of integer programs and their linear relaxations as proximity. In 2018, Eisenbrand and Weismantel proved that proximity is independent of the dimension for programs in standard form. We…

Optimization and Control · Mathematics 2020-01-15 Jon Lee , Joseph Paat , Ingo Stallknecht , Luze Xu

Let $F\in\mathbb{C}[x,y,s,t]$ be an irreducible constant-degree polynomial, and let $A,B,C,D\subset\mathbb{C}$ be finite sets of size $n$. We show that $F$ vanishes on at most $O(n^{8/3})$ points of the Cartesian product $A\times B\times…

Combinatorics · Mathematics 2016-11-03 Orit E. Raz , Micha Sharir , Frank de Zeeuw

Using techniques from harmonic analysis, we derive several sharp stability estimates for the second order Heisenberg Uncertainty Principle. We also present the explicit lower and upper bounds for the sharp stability constants and compute…

Analysis of PDEs · Mathematics 2025-12-23 Anh Xuan Do , Nguyen Lam , Guozhen Lu

New sufficient conditions for representation of a function via the absolutely convergent Fourier integral are obtained in the paper. In the main result, Theorem 1.1, this is controlled by the behavior near infinity of both the function and…

Classical Analysis and ODEs · Mathematics 2009-06-01 E. Liflyand , R. Trigub

We introduce a continuous analog of the Fourier ratio for compactly supported Borel measures. For a measure \(\mu\) on \(\mathbb{R}^d\) and \(f\in L^2(\mu)\), the Fourier ratio compares \(L^1\) and \(L^2\) norms of a regularized Fourier…

Classical Analysis and ODEs · Mathematics 2025-12-19 A. Iosevich , Z. Li , E. Palsson , A. Yavicoli

Many mathematical models utilize limit processes. Continuous functions and the calculus, differential equations and topology, all are based on limits and continuity. However, when we perform measurements and computations, we can achieve…

Artificial Intelligence · Computer Science 2025-10-20 Mark Burgin

We extend the Kahane-Katznelson-de Leeuw theorem to smoothness spaces by showing that for any $g \in W^{l,2}(\mathbb{T}^d)$, there exists a function $f\in C^l(\mathbb{T}^d)$ satisfying $|\widehat{f}(n)|\geq |\widehat{g}(n)|$ and…

Classical Analysis and ODEs · Mathematics 2025-03-19 Miquel Saucedo , Sergey Tikhonov

Reliability-based design optimization (RBDO) approaches aim to identify the best design of an engineering problem, whilst the probability of failure (PoF) remains below an acceptable value. Thus, the incorporation of the sharpest bounds on…

Computational Engineering, Finance, and Science · Computer Science 2025-03-18 Niklas Miska , Daniel Balzani

We prove an explicit formula for the dependence of the exponent in the fractal uncertainty principle of Bourgain-Dyatlov on the dimension and on the regularity constant for the regular set. In particular, this implies an explicit essential…

Classical Analysis and ODEs · Mathematics 2018-06-06 Long Jin , Ruixiang Zhang

Let f:{-1,1}^n -> R be a real function on the hypercube, given by its discrete Fourier expansion, or, equivalently, represented as a multilinear polynomial. We say that it is Boolean if its image is in {-1,1}. We show that every function on…

Discrete Mathematics · Computer Science 2013-11-13 Tom Gur , Omer Tamuz

A central problem in signal processing and communications is to design signals that are compact both in time and frequency. Heisenberg's uncertainty principle states that a given function cannot be arbitrarily compact both in time and…

Information Theory · Computer Science 2014-01-17 Reza Parhizkar , Yann Barbotin , Martin Vetterli

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

We prove a fractal uncertainty principle with exponent $\frac{d}{2} - \delta + \varepsilon$, $\varepsilon > 0$, for Ahlfors--David regular subsets of $\mathbb R^d$ with dimension $\delta$ which satisfy a suitable "nonorthogonality…

Classical Analysis and ODEs · Mathematics 2025-06-18 Aidan Backus , James Leng , Zhongkai Tao

We obtain new effective results in best approximation theory, specifically moduli of uniqueness and constants of strong unicity, for the problem of best uniform approximation with bounded coefficients, as first considered by Roulier and…

Classical Analysis and ODEs · Mathematics 2021-12-30 Andrei Sipos

A function defined on the Boolean hypercube is $k$-Fourier-sparse if it has at most $k$ nonzero Fourier coefficients. For a function $f: \mathbb{F}_2^n \rightarrow \mathbb{R}$ and parameters $k$ and $d$, we prove a strong upper bound on the…

Data Structures and Algorithms · Computer Science 2015-04-08 Ishay Haviv , Oded Regev