A Robust Version of Hegedűs's Lemma, with Applications

02/10/2022
by   Srikanth Srinivasan, et al.
0

Hegedűs's lemma is the following combinatorial statement regarding polynomials over finite fields. Over a field of characteristic p > 0 and for q a power of p, the lemma says that any multilinear polynomial P∈[x_1,…,x_n] of degree less than q that vanishes at all points in {0,1}^n of Hamming weight k∈ [q,n-q] must also vanish at all points in {0,1}^n of weight k + q. This lemma was used by Hegedűs (2009) to give a solution to Galvin's problem, an extremal problem about set systems; by Alon, Kumar and Volk (2018) to improve the best-known multilinear circuit lower bounds; and by Hrubeš, Ramamoorthy, Rao and Yehudayoff (2019) to prove optimal lower bounds against depth-2 threshold circuits for computing some symmetric functions. In this paper, we formulate a robust version of Hegedűs's lemma. Informally, this version says that if a polynomial of degree o(q) vanishes at most points of weight k, then it vanishes at many points of weight k+q. We prove this lemma and give three different applications.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/04/2019

Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC^0

The threshold degree of a Boolean function f{0,1}^n→{0,1} is the minimum...
research
01/04/2023

New Lower Bounds against Homogeneous Non-Commutative Circuits

We give several new lower bounds on size of homogeneous non-commutative ...
research
06/15/2018

Arithmetic Circuits with Locally Low Algebraic Rank

In recent years, there has been a flurry of activity towards proving low...
research
02/26/2018

Limits on representing Boolean functions by linear combinations of simple functions: thresholds, ReLUs, and low-degree polynomials

We consider the problem of representing Boolean functions exactly by "sp...
research
01/25/2023

Extended Nullstellensatz proof systems

For a finite set F of polynomials over fixed finite prime field of size ...
research
08/01/2023

Sharp Taylor Polynomial Enclosures in One Dimension

It is often useful to have polynomial upper or lower bounds on a one-dim...
research
02/13/2021

Lower Bounds on Dynamic Programming for Maximum Weight Independent Set

We prove lower bounds on pure dynamic programming algorithms for maximum...

Please sign up or login with your details

Forgot password? Click here to reset