相关论文: Fourier inequalities and sign uncertainty
In this paper we study the uncertainty principle (UP) connecting a function over a finite field and its Mattson-Solomon polynomial, which is a kind of Fourier transform in positive characteristic. Three versions of the UP over finite fields…
An uncertainty quantification framework is developed for Eulerian-Lagrangian models of particle-laden flows, where the fluid is modeled through a system of partial differential equations in the Eulerian frame and inertial particles are…
In an incoherent dictionary, most signals that admit a sparse representation admit a unique sparse representation. In other words, there is no way to express the signal without using strictly more atoms. This work demonstrates that sparse…
The concern about hidden discrimination in machine learning models is growing, as their widespread real-world applications increasingly impact human lives. Various techniques, including commonly used group fairness measures and several…
Let $f$ be a finite signal. The classical uncertainty principle tells us that the product of the support of $f$ and the support of $\hat{f}$, the Fourier transform of $f$, must satisfy $|supp(f)|\cdot|supp(\hat{f})|\geq |G|$. Recently,…
The Fenchel-Young inequality is fundamental in Convex Analysis and Optimization. It states that the difference between certain function values of two vectors and their inner product is nonnegative. Recently, Carlier introduced a very nice…
In this paper we derive new upper bounds for the densities of measurable sets in R^n which avoid a finite set of prescribed distances. The new bounds come from the solution of a linear programming problem. We apply this method to obtain new…
An uncertainty inequality is presented that establishes a lower limit for the product of the variance of the time-averaged intensity of a mode of a quantized electromagnetic field and the degree of its spatial localization. The lower limit…
We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…
Several uncertainty principles are proved for the Fock space.
The role of the Uncertainty Principle is examined through the examples of squeezing, information capacity, and position monitoring. It is suggested that more attention should be directed to conceptual considerations in quantum information…
The purpose of this short note is to demonstrate how some techniques from additive combinatorics recently developed by Peluse and Peluse-Prendiville can be applied to give an alternative proof for a trilinear smoothing inequality originally…
Entropic uncertainty relations place nontrivial lower bounds to the sum of Shannon information entropies for noncommuting observables. Here we obtain a novel lower bound on the entropy sum for general pairs of observables in…
Upper and lower bounds on the error probability of linear codes under maximum-likelihood (ML) decoding are shortly surveyed and applied to ensembles of codes on graphs. For upper bounds, focus is put on Gallager bounding techniques and…
We consider the problem of testing whether a Boolean function has Fourier degree $\leq k$ or it is $\epsilon$-far from any Boolean function with Fourier degree $\leq k$. We improve the known lower bound of $\Omega(k)$ \cite{BBM11,CGM10}, to…
Originally developed for measuring the heterogeneity of wealth measures, inequality indices are quantitative scores that take values in the unit interval, with the zero score characterizing perfect equality. In this paper, we draw attention…
Being motivated by general interest as well as by certain concrete problems of Fourier Analysis, we construct analogs of the Lp spaces for measures. It turns out that most of standard properties of the usual Lp spaces for functions are…
We prove lower bounds for the Dirichlet Laplacian on possibly unbounded domains in terms of natural geometric conditions. This is used to derive uncertainty principles for low energy functions of general elliptic second order divergence…
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…
Recently Kosaki proved an inequality for matrices that can be seen as a kind of new uncertainty principle. Independently, the same result was proved by Yanagi, Furuichi and Kuriyama. The new bound is given in terms of Wigner-Yanase-Dyson…