Boolean functions on $S_n$ which are nearly linear
Combinatorics
2021-12-13 v2 Discrete Mathematics
Abstract
We show that if is -close to linear in and then is -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 is linear, , and , then is -close to a union of mostly disjoint cosets, and this is also sharp; and that if is linear and -close to in then is -close in 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