Papers
Topics
Authors
Recent
Search
2000 character limit reached

Factors of Sparse Polynomials are Sparse

Published 18 Apr 2014 in cs.CC, cs.DM, math.AG, and math.CO | (1404.4834v2)

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 $F$ is a field with prime characteristic $p$, then the polynomial $x_1p + x_2p + \ldots + xnp$ has the following factor: $(x_1+x_2+ \ldots + x_n){p-1}$, which has sparsity $np$.

Citations (6)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.