The sparsity of a polynomial is defined as the number of monomials in it. We will show that given a sparse polynomial f with bounded individual degree, the sparsity of its factors can be quasi-polynomially bounded by the sparsity of f. This result is from the paper "Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree" by Bhargava, Saraf and Volkovich. The proof is beautiful and uses techniques from convex geometry.
