English

Boolean functions on $S_n$ which are nearly linear

Combinatorics 2021-12-13 v2 Discrete Mathematics

Abstract

We show that if f ⁣:Sn{0,1}f\colon S_n \to \{0,1\} is ϵ\epsilon-close to linear in L2L_2 and E[f]1/2\mathbb{E}[f] \leq 1/2 then ff is O(ϵ)O(\epsilon)-close to a union of "mostly disjoint" cosets, and moreover this is sharp: any such union is close to linear. This constitutes a sharp Friedgut-Kalai-Naor theorem for the symmetric group. Using similar techniques, we show that if f ⁣:SnRf\colon S_n \to \mathbb{R} is linear, Pr[f{0,1}]ϵ\Pr[f \notin \{0,1\}] \leq \epsilon, and Pr[f=1]1/2\Pr[f = 1] \leq 1/2, then ff is O(ϵ)O(\epsilon)-close to a union of mostly disjoint cosets, and this is also sharp; and that if f ⁣:SnRf\colon S_n \to \mathbb{R} is linear and ϵ\epsilon-close to {0,1}\{0,1\} in LL_\infty then ff is O(ϵ)O(\epsilon)-close in LL_\infty to a union of disjoint cosets.

Cite

@article{arxiv.2107.07833,
  title  = {Boolean functions on $S_n$ which are nearly linear},
  author = {Yuval Filmus},
  journal= {arXiv preprint arXiv:2107.07833},
  year   = {2021}
}

Comments

27 pages

R2 v1 2026-06-24T04:15:38.195Z