Papers
Topics
Authors
Recent
Search
2000 character limit reached

Boolean functions on $S_n$ which are nearly linear

Published 16 Jul 2021 in math.CO and cs.DM | (2107.07833v2)

Abstract: 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 linear. This constitutes a sharp Friedgut-Kalai-Naor theorem for the symmetric group. Using similar techniques, we show that if $f\colon S_n \to \mathbb{R}$ is linear, $\Pr[f \notin {0,1}] \leq \epsilon$, and $\Pr[f = 1] \leq 1/2$, then $f$ is $O(\epsilon)$-close to a union of mostly disjoint cosets, and this is also sharp; and that if $f\colon S_n \to \mathbb{R}$ is linear and $\epsilon$-close to ${0,1}$ in $L_\infty$ then $f$ is $O(\epsilon)$-close in $L_\infty$ to a union of disjoint cosets.

Citations (4)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.