English
Related papers

Related papers: Fourier inequalities and sign uncertainty

200 papers

Using Fourier analysis, we derive Wirtinger-type inequalities of arbitrary high order. As applications, we prove various sharp geometric inequalities for closed curves on the Euclidean plane. In particular, we obtain both sharp lower and…

Differential Geometry · Mathematics 2020-08-18 Kwok-Kun Kwong , Hojoo Lee

We give a new bound on the sum of the linear Fourier coefficients of a Boolean function in terms of its parity decision tree complexity. This result generalizes an inequality of O'Donnell and Servedio for regular decision trees. We use this…

Discrete Mathematics · Computer Science 2015-06-04 Eric Blais , Li-Yang Tan , Andrew Wan

We construct a multi-observable uncertainty equality as well as an inequality based on the sum of standard deviations in the qubit system. The obtained equality indicates that the uncertainty relation can be expressed more accurately, and…

Quantum Physics · Physics 2020-06-08 Xiao Zheng , Shaoqiang Ma , Guofeng Zhang

In recent years, the log-concavity or log-convexity of combinatorial sequences and their root sequences, higher order Tur{\'a}n inequalities, and Laguerre inequalities of order two have been widely studied. However, the research of the…

Combinatorics · Mathematics 2025-06-25 Zhongjie Li

Error bounds have been studied for more than seventy years, beginning with the seminal result of Hoffman (1952) [{\it J. Res. Natl. Bur. Standards}, 49 (1952), 263--265], which establishes an upper bound for the distance from an arbitrary…

Optimization and Control · Mathematics 2026-05-25 Zhou Wei , Michel Thera , Jen-Chih Yao

We consider the nonlinear Schrodinger equation with a modified spatial dispersion, given either by an homogeneous Fourier multiplier, or by a bounded Fourier multiplier. Arguments based on ordinary differential equations yield ill-posedness…

Analysis of PDEs · Mathematics 2011-10-11 Rémi Carles

A geometric inequality among three triangles, originating in circle packing problems, is introduced. In order to prove it, we reduce the original formulation to the nonnegativity of a particular polynomial in four real indeterminates.…

Algebraic Geometry · Mathematics 2007-05-23 Pablo A. Parrilo , Ronen Peretz

By use of window functions, time-frequency analysis tools like Short Time Fourier Transform overcome a shortcoming of the Fourier Transform and enable us to study the time- frequency characteristics of signals which exhibit transient os-…

Information Theory · Computer Science 2013-07-25 Sangnam Nam

We derive strong variance-based uncertainty relations for arbitrary two and more unitary operators by re-examining the mathematical foundation of the uncertainty relation. This is achieved by strengthening the celebrated Cauchy-Schwarz…

Quantum Physics · Physics 2022-01-25 Xiaoli Hu , Naihuan Jing

Inverse problems play a key role in modern image/signal processing methods. However, since they are generally ill-conditioned or ill-posed due to lack of observations, their solutions may have significant intrinsic uncertainty. Analysing…

Signal Processing · Electrical Eng. & Systems 2019-09-09 Xiaohao Cai , Marcelo Pereyra , Jason D. McEwen

It is well-known that the Fourier-Galerkin spectral method has been a popular approach for the numerical approximation of the deterministic Boltzmann equation with spectral accuracy rigorously proved. In this paper, we will show that such a…

Numerical Analysis · Mathematics 2024-05-08 Liu Liu , Kunlun Qi

The goal of this paper is to review the main trends in the domain of uncertainty principles and localization, emphasize their mutual connections and investigate practical consequences. The discussion is strongly oriented towards, and…

Information Theory · Computer Science 2013-09-23 Benjamin Ricaud , Bruno Torresani

Classical results due to Ingham and Paley-Wiener characterize the existence of nonzero functions supported on certain subsets of the real line in terms of the pointwise decay of the Fourier transforms. Viewing these results as uncertainty…

Functional Analysis · Mathematics 2016-06-08 Mithun Bhowmik , Suparna Sen

We give an explicit upper bound for the first sign change of the Fourier coefficients of an arbitrary non-zero Siegel cusp form $F$ of even integral weight on the Siegel modular group of arbitrary genus $ g\geq 2 $.

Number Theory · Mathematics 2014-03-20 YoungJu Choie , Sanoli Gun , Winfried Kohnen

To more flexibly balance between exploration and exploitation, a new meta-heuristic method based on Uncertainty Principle concepts is proposed in this paper. UP is is proved effective in multiple branches of science. In the branch of…

Neural and Evolutionary Computing · Computer Science 2020-06-18 Mojtaba Moattari , Mohammad Hassan Moradi , Emad Roshandel

This paper originates from a naive attempt to establish various non-commutative Fourier theoretic inequalities for an inclusion of simple C*-algebras equipped with a conditional expectation of index-finite type. In this setting, we discuss…

Operator Algebras · Mathematics 2026-01-19 Keshab Chandra Bakshi , Satyajit Guin , Sruthymurali

Let G be a finite abelian group of order n. For a complex valued function f on G, let \fht denote the Fourier transform of f. The uncertainty inequality asserts that if f \neq 0 then |supp(f)| |supp(\fht)| \geq n. Answering a question of…

Combinatorics · Mathematics 2007-05-23 Roy Meshulam

In this paper, we mainly establish the uncertainty principle (UP) for a function and its quaternion Fractional Fourier transform (QFrFT), as well as the UP for two QFrFTs. Using the polar representation of quaternion-valued signals, we give…

Complex Variables · Mathematics 2026-05-26 Ke Cui , Haipan Shi , Xiaomin Tang

The need to measure bias encoded in tabular data that are used to solve pattern recognition problems is widely recognized by academia, legislators and enterprises alike. In previous work, we proposed a bias quantification measure, called…

Machine Learning · Computer Science 2022-01-24 Gonzalo Nápoles , Lisa Koutsoviti Koumeri

Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potential energy of spherical designs. This approach gives unified bounds that are valid for a large class of potential functions. Our lower bounds…

Metric Geometry · Mathematics 2015-09-28 P. G. Boyvalenkov , P. D. Dragnev , D. P. Hardin , E. B. Saff , M. M. Stoyanova