Sparse polynomial

In mathematics, a sparse polynomial (also lacunary polynomial or fewnomial) is a polynomial that has far fewer terms than its degree and number of variables would suggest. For example, $x^{10} + 3x^{3} − 1$ is a sparse polynomial as it is a trinomial with a degree of 10.

The motivation for studying sparse polynomials is to concentrate on the structure of a polynomial's monomials instead of its degree, as one can see, for instance, by comparing Bernstein-Kushnirenko theorem with Bezout's theorem. Research on sparse polynomials has also included work on algorithms whose running time grows as a function of the number of terms rather than on the degree, for problems including polynomial multiplication, division, root-finding algorithms, and polynomial greatest common divisors. Sparse polynomials have also been used in pure mathematics, especially in the study of Galois groups, because it has been easier to determine the Galois groups of certain families of sparse polynomials than it is for other polynomials.

The algebraic varieties determined by sparse polynomials have a simple structure, which is also reflected in the structure of the solutions of certain related differential equations. Additionally, a sparse positivstellensatz exists for univariate sparse polynomials. It states that the non-negativity of a polynomial can be certified by sos polynomials whose degree only depends on the number of monomials of the polynomial.

Sparse polynomials oftentimes come up in sum or difference of powers equations. The sum of two cubes states that $(a + b)(a^{2} − ab + b^{2}) = a^{3} + b^{3}$. $a^{3} + b^{3}$, here, is a sparse polynomial.