English
Related papers

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

200 papers

We prove that Boolean functions on $S_{n}$ whose Fourier transform is highly concentrated on the first two irreducible representations of $S_n$, are close to being unions of cosets of point-stabilizers. We use this to give a natural proof…

Combinatorics · Mathematics 2017-07-03 David Ellis , Yuval Filmus , Ehud Friedgut

We prove that Boolean functions on $S_n$, whose Fourier transform is highly concentrated on irreducible representations indexed by partitions of $n$ whose largest part has size at least $n-t$, are close to being unions of cosets of…

Combinatorics · Mathematics 2017-06-30 David Ellis , Yuval Filmus , Ehud Friedgut

We analyze the sketching approximability of constraint satisfaction problems on Boolean domains, where the constraints are balanced linear threshold functions applied to literals. In~particular, we explore the approximability of…

Computational Complexity · Computer Science 2022-07-18 Chi-Ning Chou , Alexander Golovnev , Amirbehshad Shahrasbi , Madhu Sudan , Santhoshini Velusamy

We consider Boolean functions f:{-1,1}^n->{-1,1} that are close to a sum of independent functions on mutually exclusive subsets of the variables. We prove that any such function is close to just a single function on a single subset. We also…

Probability · Mathematics 2015-12-31 Aviad Rubinstein , Muli Safra

The $U^2$ norm gives a useful measure of quasirandomness for real- or complex-valued functions defined on finite (or, more generally, locally compact) groups. A simple Fourier-analytic argument yields an inverse theorem, which shows that a…

Group Theory · Mathematics 2016-11-01 W. T. Gowers , O. Hatami

About twenty years ago we wrote a paper, "Boolean Functions whose Fourier Transform is Concentrated on the First Two Levels", \cite{FKN}. In it we offered several proofs of the statement that Boolean functions $f(x_1,x_2,\dots,x_n)$, whose…

Combinatorics · Mathematics 2021-05-10 Ehud Friedgut , GIl Kalai , Assaf Naor

A Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ is called a dictator if it depends on exactly one variable i.e $f(x_1, x_2, \ldots, x_n) = x_i$ for some $i\in [n]$. In this work, we study a $k$-query dictatorship test. Dictatorship…

Computational Complexity · Computer Science 2017-02-17 Amey Bhangale , Subhash Khot , Devanathan Thiruvenkatachari

The Friedgut-Kalai-Naor (FKN) theorem states that if $f$ is a Boolean function on the Boolean cube which is close to degree 1, then $f$ is close to a dictator, a function depending on a single coordinate. The author has extended the theorem…

Combinatorics · Mathematics 2020-04-01 Yuval Filmus

Bourgain showed that any noise stable Boolean function $f$ can be well-approximated by a junta. In this note we give an exponential sharpening of the parameters of Bourgain's result under the additional assumption that $f$ is a halfspace.

Computational Complexity · Computer Science 2012-03-01 Ilias Diakonikolas , Ragesh Jaiswal , Rocco A. Servedio , Li-Yang Tan , Andrew Wan

We prove sharp estimates for Fourier transforms of indicator functions of bounded open sets in ${\mathbb R}^n$ with real analytic boundary, as well as nontrivial lattice point discrepancy results. Both will be derived from estimates on…

Classical Analysis and ODEs · Mathematics 2021-01-19 Michael Greenblatt

In this note we consider Boolean functions defined on the discrete cube equipped with a biased product probability measure. We prove that if the spectrum of such a function is concentrated on the first two Fourier levels, then the function…

Combinatorics · Mathematics 2013-11-14 Piotr Nayar

Every Boolean function can be uniquely represented as a multilinear polynomial. The entropy and the total influence are two ways to measure the concentration of its Fourier coefficients, namely the monomial coefficients in this…

Computational Complexity · Computer Science 2017-11-03 Rani Hod

We prove that the Fourier dimension of any Boolean function with Fourier sparsity $s$ is at most $O\left(s^{2/3}\right)$. Our proof method yields an improved bound of $\widetilde{O}(\sqrt{s})$ assuming a conjecture of…

Computational Complexity · Computer Science 2014-07-15 Swagato Sanyal

We show that if $f\colon S_n \to \{0,1\}$ is $\epsilon$-close to linear in $L_2$ and $\mathbb{E}[f] \leq 1/2$ then $f$ is $O(\epsilon)$-close to a union of "mostly disjoint" cosets, and moreover this is sharp: any such union is close to…

Combinatorics · Mathematics 2021-12-13 Yuval Filmus

Given a convex function $\Phi:[0,1]\to\mathbb{R}$, the $\Phi$-stability of a Boolean function $f$ is defined as $\mathbb{E}[\Phi(T_{\rho}f(\mathbf{X}))]$, where $\mathbf{X}$ is a random vector uniformly distributed on the discrete cube…

Probability · Mathematics 2026-04-08 Lei Yu

We establish a stability result for the Shannon-McMillan-Breiman theorem on the one-sided finite shift space. For any shift-invariant probability measure P and any data-dependent parsing whose number of blocks is sublinear in N almost…

Information Theory · Computer Science 2026-04-16 Raphael Grondin

We show that a $k$-stable set in a finite group can be approximated, up to given error $\epsilon>0$, by left cosets of a subgroup of index $\epsilon^{\text{-}O_k(1)}$. This improves the bound in a similar result of Terry and Wolf on stable…

Combinatorics · Mathematics 2022-03-04 Gabriel Conant

For a finitely generated group $G$ and collection of subgroups $\mathcal{P}$ we prove that the relative Dehn function of a pair $(G,\mathcal{P})$ is invariant under quasi-isometry of pairs. Along the way we show quasi-isometries of pairs…

Group Theory · Mathematics 2025-01-15 Sam Hughes , Eduardo Martínez-Pedroza , Luis Jorge Sánchez Saldaña

Consider any Dirichlet series sum a_n/n^z with nonnegative coefficients a_n and finite sum function f(z)=f(x+iy) when x is greater than 1. Denoting the partial sum a_1+...+a_N by s_N, the paper gives the following necessary and sufficient…

Number Theory · Mathematics 2008-07-04 Jacob Korevaar

We introduce a relaxation of stability, called almost sure stability, which is insensitive to perturbations by subsets of Loeb measure $0$ in a non-standard finite group. We show that almost sure stability satisfies a stationarity principle…

Logic · Mathematics 2026-01-14 Amador Martin-Pizarro , Daniel Palacin , Julia Wolf
‹ Prev 1 2 3 10 Next ›