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 and , the average sensitivity of a degree- polynomial threshold function on variables is maximized by the degree- symmetric polynomial which computes the parity function on the layers of the hypercube with Hamming weight closest to . We refute the conjecture for almost all and for almost all , 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