Factors of Sparse Polynomials are Sparse
Computational Complexity
2014-08-10 v2 Discrete Mathematics
Algebraic Geometry
Combinatorics
Abstract
This paper was removed due to an error in the proof (Claim 4.12 as stated is not true). The authors would like to thank Ilya Volkovich for pointing out a counterexample to this paper's main result in positive characteristic: If is a field with prime characteristic , then the polynomial x_1^p + x_2^p + \ldots + x^n^p has the following factor: , which has sparsity .
Cite
@article{arxiv.1404.4834,
title = {Factors of Sparse Polynomials are Sparse},
author = {Zeev Dvir and Rafael Mendes de Oliveira},
journal= {arXiv preprint arXiv:1404.4834},
year = {2014}
}
Comments
This paper was removed due to an error in the proof (Claim 4.12 as stated is not true)