Elementary symmetric polynomial
In mathematics, specifically in commutative algebra, the elementary symmetric polynomials are one type of basic building block for symmetric polynomials, in the sense that any symmetric polynomial can
Polarization of an algebraic form
In mathematics, in particular in algebra, polarization is a technique for expressing a homogeneous polynomial in a simpler fashion by adjoining more variables. Specifically, given a homogeneous polyno
Zonal polynomial
In mathematics, a zonal polynomial is a multivariate symmetric homogeneous polynomial. The zonal polynomials form a basis of the space of symmetric polynomials. They appear as zonal spherical function
Monomial ideal
In abstract algebra, a monomial ideal is an ideal generated by monomials in a multivariate polynomial ring over a field. A toric ideal is an ideal generated by differences of monomials (provided the i
Power sum symmetric polynomial
In mathematics, specifically in commutative algebra, the power sum symmetric polynomials are a type of basic building block for symmetric polynomials, in the sense that every symmetric polynomial with
Determinant
In mathematics, the determinant is a scalar value that is a function of the entries of a square matrix. It characterizes some properties of the matrix and the linear map represented by the matrix. In
Complete homogeneous symmetric polynomial
In mathematics, specifically in algebraic combinatorics and commutative algebra, the complete homogeneous symmetric polynomials are a specific kind of symmetric polynomials. Every symmetric polynomial
Cubic form
In mathematics, a cubic form is a homogeneous polynomial of degree 3, and a cubic hypersurface is the zero set of a cubic form. In the case of a cubic form in three variables, the zero set is a cubic
Diagonal form
In mathematics, a diagonal form is an algebraic form (homogeneous polynomial) without cross-terms involving different indeterminates. That is, it is for some given degree m. Such forms F, and the hype
Faddeev–LeVerrier algorithm
In mathematics (linear algebra), the Faddeev–LeVerrier algorithm is a recursive method to calculate the coefficients of the characteristic polynomial of a square matrix, A, named after Dmitry Konstant
Monomial
In mathematics, a monomial is, roughly speaking, a polynomial which has only one term. Two definitions of a monomial may be encountered: 1.
* A monomial, also called power product, is a product of po
SOS-convexity
A multivariate polynomial is SOS-convex (or sum of squares convex) if its Hessian matrix H can be factored as H(x) = ST(x)S(x) where S is a matrix (possibly rectangular) which entries are polynomials
Schur polynomial
In mathematics, Schur polynomials, named after Issai Schur, are certain symmetric polynomials in n variables, indexed by partitions, that generalize the elementary symmetric polynomials and the comple
Bombieri norm
In mathematics, the Bombieri norm, named after Enrico Bombieri, is a norm on homogeneous polynomials with coefficient in or (there is also a version for non homogeneous univariate polynomials). This n
Norm form
In mathematics, a norm form is a homogeneous form in n variables constructed from the field norm of a field extension L/K of degree n. That is, writing N for the norm mapping to K, and selecting a bas
Homogeneous polynomial
In mathematics, a homogeneous polynomial, sometimes called quantic in older texts, is a polynomial whose nonzero terms all have the same degree. For example, is a homogeneous polynomial of degree 5, i
Polynomial SOS
In mathematics, a form (i.e. a homogeneous polynomial) h(x) of degree 2m in the real n-dimensional vector x is sum of squares of forms (SOS) if and only if there exist forms of degree m such that Ever