English

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 FF is a field with prime characteristic pp, then the polynomial x_1^p + x_2^p + \ldots + x^n^p has the following factor: (x1+x2++xn)p1(x_1+x_2+ \ldots + x_n)^{p-1}, which has sparsity npn^p.

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)

R2 v1 2026-06-22T03:53:51.723Z