English
Related papers

Related papers: A composition theorem for the Fourier Entropy-Infl…

200 papers

We investigate the influences of variables on a Boolean function $f$ based on the quantum Bernstein-Vazirani algorithm. A previous paper (Floess et al. in Math. Struct. in Comp. Science 23: 386, 2013) has proved that if a $n$-variable…

Data Structures and Algorithms · Computer Science 2015-01-21 Hong-Wei Li , Li Yang

The strategy of using the definition of work function from photoelectric effect to determine precise and reliable work function by the contribution of frequency to photoelectric yield is investigated theoretically in this paper. Based on…

General Physics · Physics 2017-06-09 Changshi Liu

Let $S \subset \Bbb R^n$ be a smooth compact hypersurface with a strictly positive second fundamental form, $E$ be the Fourier extension operator on $S$, and $X$ be a Lebesgue measurable subset of $\Bbb R^n$. If $X$ contains a ball of each…

Classical Analysis and ODEs · Mathematics 2023-06-22 Bassam Shayya

We study universal features in the shape dependence of entanglement entropy in the vacuum state of a conformal field theory (CFT) on $\mathbb{R}^{1,d-1}$. We consider the entanglement entropy across a deformed planar or spherical entangling…

High Energy Physics - Theory · Physics 2016-04-22 Thomas Faulkner , Robert G. Leigh , Onkar Parrikar

We extend an uncertainty principle due to Beurling into a characterization of Hermite functions. More precisely, all functions $f$ on $\R^d$ which may be written as $P(x)\exp (Ax,x)$, with $A$ a real symmetric definite positive matrix, are…

Classical Analysis and ODEs · Mathematics 2007-05-23 Aline Bonami , Bruno Demange , Philippe Jaming

Bayes' theorem incorporates distinct types of information through the likelihood and prior. Direct observations of state variables enter the likelihood and modify posterior probabilities through consistent updating. Information in terms of…

Methodology · Statistics 2024-07-19 Duncan K. Foley , Ellis Scharfenaker

We consider functions satisfying the subcritical Beurling's condition, viz., $$\int_{\R^n}\int_{\R^n} |f(x)| |\hat{f}(y)| e^{a |x \cdot y|} \, dx \, dy < \infty$$ for some $ 0 < a < 1.$ We show that such functions are entire vectors for the…

Classical Analysis and ODEs · Mathematics 2022-06-29 Rahul Garg , Sundaram Thangavelu

We examine Fourier frames and, more generally, frame measures for different probability measures. We prove that if a measure has an associated frame measure, then it must have a certain uniformity in the sense that the weight is distributed…

Functional Analysis · Mathematics 2021-07-20 Dorin Ervin Dutkay , Chun-Kit Lai

This article is centered around generalizing a previous implicit function theorem of the author to be applicable for maps f:E sqcap F to F which can be lifted to Keller C^k_pi maps f_i:E sqcap F_i to F_i with F_i Banach and F=projlim F_i .…

Functional Analysis · Mathematics 2007-05-23 Seppo I Hiltunen

When two independent analog signals, X and Y are added together giving Z=X+Y, the entropy of Z, H(Z), is not a simple function of the entropies H(X) and H(Y), but rather depends on the details of X and Y's distributions. Nevertheless, the…

Quantum Physics · Physics 2014-02-21 Robert Koenig , Graeme Smith

Block sensitivity ($bs(f)$), certificate complexity ($C(f)$) and fractional certificate complexity ($C^*(f)$) are three fundamental combinatorial measures of complexity of a boolean function $f$. It has long been known that $bs(f) \leq…

Computational Complexity · Computer Science 2013-06-05 Justin Gilmer , Michael Saks , Srikanth Srinivasan

Ergodic theory includes several notions of entropy for probability-preserving actions of countable groups. These include Kolmogorov--Sinai entropy based on F\o lner sequences for amenable groups, entropy defined using a random ordering of…

Operator Algebras · Mathematics 2026-03-23 Tim Austin

In this paper we derive tight bounds on the expected value of products of {\em low influence} functions defined on correlated probability spaces. The proofs are based on extending Fourier theory to an arbitrary number of correlated…

Probability · Mathematics 2009-06-01 Elchanan Mossel

Let $G$ be a locally compact abelian group, and let $\widehat{G}$ denote its dual group, equipped with a Haar measure. A variant of the uncertainty principle states that for any $S \subset G$ and $\Sigma \subset \widehat{G}$, there exists a…

Classical Analysis and ODEs · Mathematics 2025-03-05 Philippe Jaming , Alexander Iosevich , Azita Mayeli

We consider the open problem: Does every square-integrable function f on a compact, connected Lie group G have an almost everywhere convergent Fourier series? We prove a general theorem from which it follows that if the integral modulus of…

Classical Analysis and ODEs · Mathematics 2021-08-31 David Grow , Donnie Myers

We completely classify Fourier summation formulas of the form $$ \int_{\mathbb{R}} \widehat{\varphi}(t) d\mu(t)=\sum_{n=0}^{\infty} a(\lambda_n)\varphi(\lambda_n), $$ that hold for any test function $\varphi$, where $\widehat\varphi$ is the…

Classical Analysis and ODEs · Mathematics 2025-04-04 Felipe Gonçalves , Guilherme Vedana

We prove the following extension of the Wiener--Wintner Theorem in Ergodic Theor and the Carleson Theorem on pointwise convergence of Fourier series: For all measure preserving flows $ (X,\mu , T_t)$ and $ f\in L^p (X,\mu)$, there is a set…

Classical Analysis and ODEs · Mathematics 2007-05-23 Michael Lacey , Erin Terwilleger

We study very smooth functions on the real line, namely Schwartz functions, that satisfy a finite identity relating their translates and a single modulation. Concretely, we assume there is a nontrivial linear combination of translates of…

Functional Analysis · Mathematics 2025-12-16 Vignon Oussa

The subject of this textbook is the analysis of Boolean functions. Roughly speaking, this refers to studying Boolean functions $f : \{0,1\}^n \to \{0,1\}$ via their Fourier expansion and other analytic means. Boolean functions are perhaps…

Discrete Mathematics · Computer Science 2021-05-24 Ryan O'Donnell

We establish two new direct product theorems for the randomized query complexity of Boolean functions. The first shows that computing $n$ copies of a function $f$, even with a small success probability of $\gamma^n$, requires $\Theta(n)$…

Computational Complexity · Computer Science 2025-12-10 Shalev Ben-David , Eric Blais