English
Related papers

Related papers: A stability result for balanced dictatorships in $…

200 papers

In this paper we study functions with low influences on product probability spaces. The analysis of boolean functions with low influences has become a central problem in discrete Fourier analysis. It is motivated by fundamental questions…

Probability · Mathematics 2007-05-23 Elchanan Mossel , Ryan O'Donnell , Krzysztof Oleszkiewicz

Let $(\mathbf X, \mathbf Y)$ denote $n$ independent, identically distributed copies of two arbitrarily correlated Rademacher random variables $(X, Y)$. We prove that the inequality $I(f(\mathbf X); g(\mathbf Y)) \le I(X; Y)$ holds for any…

Information Theory · Computer Science 2018-02-05 Georg Pichler , Pablo Piantanida , Gerald Matz

This paper is devoted to improvements of functional inequalities based on scalings and written in terms of relative entropies. When scales are taken into account and second moments fixed accordingly, deficit functionals provide explicit…

Analysis of PDEs · Mathematics 2015-05-25 Jean Dolbeault , Giuseppe Toscani

We study two conjectures posed in the analysis of Boolean functions $f : \{-1, 1\}^n \to \{-1, 1\}$, in both of which, the Majority function plays a central role: the "Majority is Least Stable" (Benjamini et al., 1999) and the…

Computational Complexity · Computer Science 2026-04-09 Pritish Kamath , Ravi Kumar , Pasin Manurangsi

We prove a sharp quantitative version of recent Faber-Krahn inequalities for the continuous Wavelet transforms associated to a certain family of Cauchy wavelet windows . Our results are uniform on the parameters of the family of Cauchy…

Functional Analysis · Mathematics 2024-11-26 Jaime Gómez , David Kalaj , Petar Melentijević , João P. G. Ramos

The Courtade-Kumar conjecture posits that dictatorship functions maximize the mutual information between the function's output and a noisy version of its input over the Boolean hypercube. We present two significant advancements related to…

Information Theory · Computer Science 2026-01-15 Adel Javanmard , David P. Woodruff

The r-th order nonlinearity of a Boolean function is the minimum number of elements that have to be changed in its truth table to arrive at a Boolean function of degree at most r. It is shown that the (suitably normalised) r-th order…

Combinatorics · Mathematics 2013-08-15 Kai-Uwe Schmidt

This paper explores the fundamental limits of a simple system, inspired by the intermittent Kalman filtering model, where the actuation direction is drawn uniformly from the unit hypersphere. The model allows us to focus on a fundamental…

Optimization and Control · Mathematics 2021-05-18 Rahul Arya , Chih-Yuan Chiu , Gireeja Ranade

We define a condition called almost strict domination for pairs of representations $\rho_1:\pi_1(S_{g,n})\to \textrm{PSL}(2,\mathbb{R})$, $\rho_2:\pi_1(S_{g,n})\to G$, where $G$ is the isometry group of a Hadamard manifold $(X,\nu)$, and…

Differential Geometry · Mathematics 2024-02-21 Nathaniel Sagman

As we all know, the Fourier transform is continuous in the weak sense of tempered distribution; this ensures the weak stability of Fourier pairs. This article investigates a stronger form of stability of the pair of homogeneous profiles…

Mathematical Physics · Physics 2019-09-16 Francois Vigneron

This manuscript includes some classical results we select apart from the new results we've found on the Analysis of Boolean Functions and Fourier-Entropy-Influence conjecture. We try to ensure the self-completeness of this work so that…

Combinatorics · Mathematics 2023-11-21 Xiao Han

We study the probability of Boolean functions with small max influence to become constant under random restrictions. Let $f$ be a Boolean function such that the variance of $f$ is $\Omega(1)$ and all its individual influences are bounded by…

Computational Complexity · Computer Science 2022-08-19 Ronen Eldan , Avi Wigderson , Pei Wu

We define a natural notion of higher order stability and show that subsets of $\mathbb{F}_p^n$ that are tame in this sense can be approximately described by a union of low-complexity quadratic varieties, up to linear error. This generalizes…

Combinatorics · Mathematics 2025-10-17 C. Terry , J. Wolf

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

The main result of this paper is a far reaching generalization of the completeness result given by V.~Katsnelson in a recent paper [35]. Instead of just using a collection of dilated Gaussians it is shown that the key steps of an earlier…

Functional Analysis · Mathematics 2022-03-22 Hans G. Feichtinger , Anupam Gumber

We investigate a model for pattern formation in the presence of Galilean symmetry proposed by Matthews and Cox [Phys.\ Rev.\ E \textbf{62}, R1473 (2000)], which has the form of coupled generalized Burgers and Ginzburg-Landau-type equations.…

Chaotic Dynamics · Physics 2015-05-19 Ka-Fai Poon , Ralf W. Wittenberg

The Fourier-Walsh expansion of a Boolean function $f \colon \{0,1\}^n \rightarrow \{0,1\}$ is its unique representation as a multilinear polynomial. The Kindler-Safra theorem (2002) asserts that if in the expansion of $f$, the total weight…

Combinatorics · Mathematics 2019-01-28 Nathan Keller , Ohad Klein

The Riesz-Sobolev inequality provides an upper bound, in integral form, for the convolution of indicator functions of subsets of Euclidean space. We formulate and prove a sharper form of the inequality. This can be equivalently phrased as a…

Classical Analysis and ODEs · Mathematics 2017-06-08 Michael Christ

The Schreier graphs of Thompson's group F with respect to the stabilizer of 1/2 and generators x_0 and x_1, and of its unitary representation in L_2([0,1]) induced by the standard action on the interval [0,1] are explicitly described. The…

Group Theory · Mathematics 2008-08-15 Dmytro Savchuk

Given a predicate $P: \{-1, 1\}^k \to \{-1, 1\}$, let $CSP(P)$ be the set of constraint satisfaction problems whose constraints are of the form $P$. We say that $P$ is approximable if given a nearly satisfiable instance of $CSP(P)$, there…

Computational Complexity · Computer Science 2020-04-28 Neng Huang , Aaron Potechin