theoretical-computer-science / Analysis of Boolean functions; polynomial threshold functions

The asymptotic Gotsman-Linial conjecture on average sensitivity of polynomial threshold functions

Theorem 1.1: for n≥1n\ge1, 1≤d≤n1\le d\le n and a real multilinear polynomial pp of degree at most dd, f=sgn(p)f=\mathrm{sgn}(p) with sgn(0)=1\mathrm{sgn}(0)=1 has I(f)≤8dnI(f)\le8d\sqrt n; the constant is absolute and dd may grow with nn. Symmetric examples show the order dnd\sqrt n is sharp for d≤nd\le\sqrt n. It removes the polylogarithmic loss in Kane's bound. It makes no claim about the exact extremizers of the original Gotsman-Linial proposal (already refuted by Chapman and by Kim-Maldonado-Wellens) and does not address non-uniform distributions.

42Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

theoretical-computer-scienceSep 25, 2026Significance 42/100Registry: lean checked

The asymptotic Gotsman-Linial conjecture on average sensitivity of polynomial threshold functions

Prior state unknown→proved

Theorem 1.1: for n≥1n\ge1, 1≤d≤n1\le d\le n and a real multilinear polynomial pp of degree at most dd, f=sgn(p)f=\mathrm{sgn}(p) with sgn(0)=1\mathrm{sgn}(0)=1 has I(f)≤8dnI(f)\le8d\sqrt n; the constant is absolute and dd may grow with nn. Symmetric examples show the order dnd\sqrt n is sharp for d≤nd\le\sqrt n. It removes the polylogarithmic loss in Kane's bound. It makes no claim about the exact extremizers of the original Gotsman-L…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Theorem 1.1: for n≥1n\ge1, 1≤d≤n1\le d\le n and a real multilinear polynomial pp of degree at most dd, f=sgn(p)f=\mathrm{sgn}(p) with sgn(0)=1\mathrm{sgn}(0)=1 has I(f)≤8dnI(f)\le8d\sqrt n; the constant is absolute and dd may grow with nn. Symmetric examples show the order dnd\sqrt n is sharp for d≤nd\le\sqrt n. It removes the polylogarithmic loss in Kane's bound. It makes no claim about the exact extremizers of the original Gotsman-Linial proposal (already refuted by Chapman and by Kim-Maldonado-Wellens) and does not address non-uniform distributions.

Theorem 1.1: for n≥1n\ge1, 1≤d≤n1\le d\le n and a real multilinear polynomial pp of degree at most dd, f=sgn(p)f=\mathrm{sgn}(p) with sgn(0)=1\mathrm{sgn}(0)=1 has I(f)≤8dnI(f)\le8d\sqrt n; the constant is absolute and dd may grow with nn. Symmetric examples show the order dnd\sqrt n is sharp for d≤nd\le\sqrt n. It removes the polylogarithmic loss in Kane's bound. It makes no claim about the exact extremizers of the original Gotsman-Linial proposal (already refuted by Chapman and by Kim-Maldonado-Wellens) and does not address non-uniform distributions.

Recorded attempts

Evidence graph

Connected research record

The asymptotic Gotsman-Linial conjecture on average sensitivity of polynomial threshold functions — Mathematical Frontier Network