English

The Gotsman-Linial Conjecture is False

Combinatorics 2021-08-06 v1 Computational Complexity

Abstract

In 1991, Craig Gotsman and Nathan Linial conjectured that for all nn and dd, the average sensitivity of a degree-dd polynomial threshold function on nn variables is maximized by the degree-dd symmetric polynomial which computes the parity function on the dd layers of the hypercube with Hamming weight closest to n/2n/2. We refute the conjecture for almost all dd and for almost all nn, and we confirm the conjecture in many of the remaining cases.

Cite

@article{arxiv.2108.02288,
  title  = {The Gotsman-Linial Conjecture is False},
  author = {Brynmor Chapman},
  journal= {arXiv preprint arXiv:2108.02288},
  year   = {2021}
}

Comments

Appeared in SODA 2018

R2 v1 2026-06-24T04:50:24.913Z