2000 character limit reached
Factors of Sparse Polynomials are Sparse (1404.4834v2)
Published 18 Apr 2014 in cs.CC, cs.DM, math.AG, and math.CO
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$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.