Almost linear Boolean functions on S_n are almost unions of cosets

by   Yuval Filmus, et al.

We show that if f S_n β†’{0,1} is Ο΅-close to linear in L_2 and 𝔼[f] ≀ 1/2 then f is O(Ο΅)-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 S_n →ℝ is linear, [f βˆ‰{0,1}] ≀ϡ, and [f = 1] ≀ 1/2, then f is O(Ο΅)-close to a union of mostly disjoint cosets, and this is also sharp; and that if f S_n →ℝ is linear and Ο΅-close to {0,1} in L_∞ then f is O(Ο΅)-close in L_∞ to a union of disjoint cosets.


page 1

page 2

page 3

page 4

βˆ™ 06/28/2019

Binary optimal linear codes from posets of the disjoint union of two chains

Recently, Chang and Hyun obtained some classes of binary optimal codes v...
βˆ™ 12/30/2021

Feferman-Vaught Decompositions for Prefix Classes of First Order Logic

The Feferman-Vaught theorem provides a way of evaluating a first order s...
βˆ™ 11/03/2017

PS-DBSCAN: An Efficient Parallel DBSCAN Algorithm Based on Platform Of AI (PAI)

We present PS-DBSCAN, a communication efficient parallel DBSCAN algorith...
βˆ™ 03/02/2023

Compressed QMC volume and surface integration on union of balls

We discuss an algorithm for Tchakaloff-like compression of Quasi-MonteCa...
βˆ™ 10/19/2020

Isotropy and Combination Problems

In a previous paper, the author and his collaborators studied the phenom...
βˆ™ 11/05/2020

Towards a more perfect union type

We present a principled theoretical framework for inferring and checking...
βˆ™ 11/14/2019

In Search of the Fastest Concurrent Union-Find Algorithm

Union-Find (or Disjoint-Set Union) is one of the fundamental problems in...

Please sign up or login with your details

Forgot password? Click here to reset