Timeline for EGZ theorem (Erdős-Ginzburg-Ziv)
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 9, 2015 at 17:46 | comment | added | Anurag | The polynomial method proof can also be interpreted as an application of a result of Alon-Furedi, which doesn't follow from Combinatorial Nullstellensatz, and is equivalent to a result in Coding Theory. See arxiv.org/abs/1404.7793, and arxiv.org/abs/1508.06020. Here's the argument, let $f = \sum x_i$ and $g = \sum a_i x_i$, where $a_i$'s are the $2p - 1$ numbers modulo $p$, then $(1 - f^{p - 1})(1 - g^{p-1})$ has degree $2p - 2$ and hence at least one non-zero in $\{0, 1\}^{2p-1}$ besides the origin, by the Alon-Furedi theorem. | |
| Mar 1, 2010 at 14:45 | comment | added | Thomas Bloom | See also the chapter on Algebraic Methods in Tao and Vu's Additive Combinatorics, for a detailed discussion about the combinatorial nullstellensatz, and many similar applications. | |
| Mar 1, 2010 at 3:54 | vote | accept | Portland | ||
| Mar 1, 2010 at 3:54 | vote | accept | Portland | ||
| Mar 1, 2010 at 3:54 | |||||
| Mar 1, 2010 at 0:28 | history | edited | Gjergji Zaimi | CC BY-SA 2.5 |
added 296 characters in body
|
| Feb 28, 2010 at 23:12 | history | answered | Gjergji Zaimi | CC BY-SA 2.5 |