Pith. sign in

REVIEW 1 cited by

Boolean functions on $S_n$ which are nearly linear

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2107.07833 v2 pith:QSZIUYSR submitted 2021-07-16 math.CO cs.DM

classification math.COcs.DM
keywords closeepsilonlinearunioncoloncosetsdisjointmathbb
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. An FKN Theorem for the Binary Grassmann Scheme

    cs.CC 2026-08 conditional novelty 8.0 of 10

    A Boolean function on the Grassmann scheme over F2 that is close to a degree 1 function is close to a canonical point/hyperplane indicator sum, up to complement.

Pith tools