A Robust Version of Heged\H{u}s's Lemma, with Applications
Heged\H{u}s's lemma is the following combinatorial statement regarding polynomials over finite fields. Over a field $\mathbb{F}$ of characteristic $p > 0$ and for $q$ a power of $p$, the lemma says that any multilinear polynomial $P\in \mathbb{F}[x_1,\ldots,x_n]$ of degree less than $q$ that...
Main Author: | Srikanth Srinivasan |
---|---|
Format: | Article |
Language: | English |
Published: |
TheoretiCS Foundation e.V.
2023-03-01
|
Series: | TheoretiCS |
Subjects: | |
Online Access: | https://theoretics.episciences.org/9143/pdf |
Similar Items
-
Pumping lemmas for weighted automata
by: Agnishom Chattopadhyay, et al.
Published: (2021-07-01) -
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
by: Samuel R. Buss, et al.
Published: (2008-12-01) -
Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing
by: Oded Goldreich, et al.
Published: (2022-12-01) -
Deterministic algorithms for the Lovász Local Lemma
by: Haeupler, Bernhard
Published: (2010) -
Undecidability of a weak version of MSO+U
by: Mikołaj Bojańczyk, et al.
Published: (2020-02-01)