Abstract We prove that for polynomials f, g, h Zx satisfying f = gh and f (0) 0, the ₂ -norm of the cofactor h is bounded by align* h ₂ {g ₀ g} f ₁ (O (g ₀^{2. 5 ²f}{g}) ) ^ {g ₀-1} \, align* where g ₀ is the number of nonzero coefficients of g (its sparsity). We also obtain similar results for polynomials over C. These bounds are an improvement over the bounds presented in an earlier conference version of this paper NS24. This result significantly improves upon previously known exponential bounds (in f) for general polynomials. It further implies that, under exact division, the polynomial division algorithm runs in quasi-linear time with respect to the input size and the number of terms in the quotient h. This resolves a long-standing open problem concerning the exact divisibility of sparse polynomials. In particular, our result demonstrates a quadratic separation between the runtime (and representation size) of exact and nonexact divisibility by sparse polynomials. Notably, prior to our work, it was not even known whether the representation size of the quotient polynomial could be bounded by a sub-quadratic function of its number of terms, or even by a subquadratic function of f.
Nahshon et al. (Thu,) studied this question.