文章基本信息
- 标题：Factors of Sparse Polynomials are Sparse
- 本地全文：下载
- 作者：Zeev Dvir ; Rafael Mendes de Oliveira
- 期刊名称：Electronic Colloquium on Computational Complexity
- 印刷版ISSN：1433-8092
- 出版年度：2014
- 卷号：2014
- 出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
- 摘要：
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 F is a field with prime characteristic p, then the polynomialxp1+xp2++xpn has the following factor:(x1+x2++xn)p−1, which has sparsity np.
