The Gotsman-Linial Conjecture is False

08/04/2021
by   Brynmor Chapman, et al.
0

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

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/21/2019

A polynomial approach to the Collatz conjecture

The Collatz conjecture is explored using polynomials based on a binary n...
research
05/31/2023

A family of Counterexamples on Inequality among Symmetric Functions

Inequalities among symmetric functions are fundamental questions in math...
research
02/18/2022

On The "Majority is Least Stable" Conjecture

We show that the "majority is least stable" conjecture is true for n=1 a...
research
06/01/2018

The real tau-conjecture is true on average

Koiran's real τ-conjecture claims that the number of real zeros of a str...
research
04/17/2020

Counterexamples to the Low-Degree Conjecture

A conjecture of Hopkins (2018) posits that for certain high-dimensional ...
research
08/05/2023

Kalai's 3^d-conjecture for unconditional and locally anti-blocking polytopes

Kalai's 3^d-conjecture states that every centrally symmetric d-polytope ...
research
04/22/2019

The undirected repetition threshold

For rational 1<r≤ 2, an undirected r-power is a word of the form xyx', w...

Please sign up or login with your details

Forgot password? Click here to reset