English
Related papers

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

200 papers

Our aim is to provide a short and self contained synthesis which generalise and unify various related and unrelated works involving what we call Phi-Sobolev functional inequalities. Such inequalities related to Phi-entropies can be seen in…

Probability · Mathematics 2021-11-30 Djalil Chafai

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

We consider a general class of Fourier coefficients for an automorphic form on a finite cover of a reductive adelic group ${\bf G}(\mathbb{A}_{\mathbb{K}})$, associated to the data of a `Whittaker pair'. We describe a quasi-order on Fourier…

We study correlation bounds under pairwise independent distributions for functions with no large Fourier coefficients. Functions in which all Fourier coefficients are bounded by $\delta$ are called $\delta$-{\em uniform}. The search for…

Probability · Mathematics 2010-11-09 Per Austrin , Elchanan Mossel

We study Fourier-sparse Boolean functions over general finite Abelian groups. A Boolean function $f : G \to \{-1,+1\}$ is $s$-sparse if it has at most $s$ non-zero Fourier coefficients. We introduce a general notion of granularity of…

Computational Complexity · Computer Science 2026-02-03 Sourav Chakraborty , Swarnalipa Datta , Pranjal Dutta , Arijit Ghosh , Swagato Sanyal

The theory of influences in product measures has profound applications in theoretical computer science, combinatorics, and discrete probability. This deep theory is intimately connected to functional inequalities and to the Fourier analysis…

Probability · Mathematics 2023-07-18 Frederic Koehler , Noam Lifshitz , Dor Minzer , Elchanan Mossel

Let $0 < \epsilon < 1/2$ be a noise parameter, and let $T_{\epsilon}$ be the noise operator acting on functions on the boolean cube $\{0,1\}^n$. Let $f$ be a nonnegative function on $\{0,1\}^n$. We upper bound the entropy of $T_{\epsilon}…

Information Theory · Computer Science 2016-06-23 Alex Samorodnitsky

We prove an invariance principle for functions on a slice of the Boolean cube, which is the set of all vectors {0,1}^n with Hamming weight k. Our invariance principle shows that a low-degree, low-influence function has similar distributions…

Probability · Mathematics 2016-02-23 Yuval Filmus , Guy Kindler , Elchanan Mossel , Karl Wimmer

We study the interplay between the Fourier-Mukai transform and the decomposition theorem for an integrable system $\pi: M \rightarrow B$. Our main conjecture is that the Fourier-Mukai transform of sheaves of K\"ahler differentials, after…

Algebraic Geometry · Mathematics 2023-01-18 Davesh Maulik , Junliang Shen , Qizheng Yin

In a prior paper, the author generalized the classical factor theorem of Sinai to actions of arbitrary countably infinite groups. In the present paper, we use this theorem and the techniques of its proof in order to study connections…

Dynamical Systems · Mathematics 2018-04-17 Brandon Seward

Let the randomized query complexity of a relation for error probability $\epsilon$ be denoted by $R_\epsilon(\cdot)$. We prove that for any relation $f \subseteq \{0,1\}^n \times \mathcal{R}$ and Boolean function $g:\{0,1\}^m \rightarrow…

Computational Complexity · Computer Science 2017-06-15 Anurag Anshu , Dmitry Gavinsky , Rahul Jain , Srijita Kundu , Troy Lee , Priyanka Mukhopadhyay , Miklos Santha , Swagato Sanyal

The intriguing and still open question concerning the composition law of $\kappa$-entropy $S_{\kappa}(f)=\frac{1}{2\kappa}\sum_i (f_i^{1-\kappa}-f_i^{1+\kappa})$ with $0<\kappa<1$ and $\sum_i f_i =1$ is here reconsidered and solved. It is…

Statistical Mechanics · Physics 2017-05-11 G. Kaniadakis , A. M. Scarfone , A. Sparavigna , T. Wada

The Eisenbud-Green-Harris conjecture states that a homogeneous ideal in k[x_1,...,x_n] containing a homogeneous regular sequence f_1,...,f_n with deg(f_i)=a_i has the same Hilbert function as an ideal containing x_i^{a_i} for 1 \leq i \leq…

Commutative Algebra · Mathematics 2007-05-23 Giulio Caviglia , Diane Maclagan

Suppose that f is a boolean function from F_2^n to {0,1} with spectral norm (that is the sum of the absolute values of its Fourier coefficients) at most M. We show that f may be expressed as +/- 1 combination of at most 2^(2^(O(M^4)))…

Classical Analysis and ODEs · Mathematics 2010-04-02 Ben Green , Tom Sanders

Talagran's correlation inequality provides quantitative lower bounds on the covariance of two increasing Boolean functions in terms of their coordinate influences, but, in general, a logarithmic loss is necessary. Motivated by a question of…

Combinatorics · Mathematics 2026-05-19 Fan Chang , Yu Chen

A classical result of Rothschild and van Lint asserts that if every non-zero Fourier coefficient of a Boolean function $f$ over $\mathbb{F}_2^{n}$ has the same absolute value, namely $|\hat{f}(\alpha)|=1/2^k$ for every $\alpha$ in the…

Computational Complexity · Computer Science 2021-04-01 Ning Xie , Shuai Xu , Yekun Xu

Let $X$ be a complete, simply connected harmonic manifold of purely exponential volume growth. This class contains all non-flat harmonic manifolds of non-positive curvature and, in particular all known examples of harmonic manifolds except…

Differential Geometry · Mathematics 2019-05-13 Kingshook Biswas , Gerhard Knieper , Norbert Peyerimhoff

Sensitivity conjecture is a longstanding and fundamental open problem in the area of complexity measures of Boolean functions and decision tree complexity. The conjecture postulates that the maximum sensitivity of a Boolean function is…

Computational Complexity · Computer Science 2014-11-14 Andris Ambainis , Mohammad Bavarian , Yihan Gao , Jieming Mao , Xiaoming Sun , Song Zuo

Using the Feferman-Vaught Theorem, we prove that a definable subset of a product structure must be a Boolean combination of open sets, in the product topology induced by giving each factor structure the discrete topology. We prove a…

Logic · Mathematics 2018-12-10 Alice Medvedev , Alexander Van Abel

One-parameter natural exponential family (NEF) plays fundamental roles in probability and statistics. This article contains two independent results: (a) A conjecture of Bar-Lev, Bshouty and Enis states that a polynomial with a simple root…

Statistics Theory · Mathematics 2018-03-05 Xiongzhi Chen