The order polynomial is a polynomial studied in mathematics, in particular in algebraic graph theory and algebraic combinatorics. The order polynomial counts the number of order-preserving maps from a poset to a chain of length . These order-preserving maps were first introduced by Richard P. Stanley while studying ordered structures and partitions as a Ph.D. student at Harvard University in 1971 under the guidance of Gian-Carlo Rota.
The orderpolynomial is a polynomial studied in mathematics, in particular in algebraic graph theory and algebraic combinatorics. The orderpolynomial counts...
mathematics, the order of a polynomial may refer to: the degree of a polynomial, that is, the largest exponent (for a univariate polynomial) or the largest...
polynomial is a polynomial of degree two in one or more variables. A quadratic function is the polynomial function defined by a quadratic polynomial....
} α where a is nonzero, which is defined by a polynomial of degree four, called a quartic polynomial. A quartic equation, or equation of the fourth degree...
In mathematics, a polynomial is a mathematical expression consisting of indeterminates (also called variables) and coefficients, that involves only the...
through the midpoint on a first degree polynomial). Low-orderpolynomials tend to be smooth and high orderpolynomial curves tend to be "lumpy". To define...
The Chebyshev polynomials are two sequences of polynomials related to the cosine and sine functions, notated as T n ( x ) {\displaystyle T_{n}(x)} and...
b x 2 + c x + d , {\displaystyle f(x)=ax^{3}+bx^{2}+cx+d,} that is, a polynomial function of degree three. In many texts, the coefficients a, b, c, and...
In linear algebra, the characteristic polynomial of a square matrix is a polynomial which is invariant under matrix similarity and has the eigenvalues...
In statistics, polynomial regression is a form of regression analysis in which the relationship between the independent variable x and the dependent variable...
{\displaystyle \operatorname {S} _{n}(x)} only for integers n ≥ 1. The order of the polynomial in the general smoothstep is 2n + 1. With n = 1, the slopes or...
In algebra, a monic polynomial is a non-zero univariate polynomial (that is, a polynomial in a single variable) in which the leading coefficient (the...
Polynomial chaos (PC), also called polynomial chaos expansion (PCE) and Wiener chaos expansion, is a method for representing a random variable in terms...
of algebra, a polynomial ring or polynomial algebra is a ring (which is also a commutative algebra) formed from the set of polynomials in one or more...
regression or local polynomial regression, also known as moving regression, is a generalization of the moving average and polynomial regression. Its most...
For a univariate polynomial, the degree of the polynomial is simply the highest exponent occurring in the polynomial. The term order has been used as...
an irreducible polynomial is, roughly speaking, a polynomial that cannot be factored into the product of two non-constant polynomials. The property of...
systems get a short check value attached, based on the remainder of a polynomial division of their contents. On retrieval, the calculation is repeated...
elementary symmetric polynomials are one type of basic building block for symmetric polynomials, in the sense that any symmetric polynomial can be expressed...
dividing one such polynomial by another, when each has a finite order (highest exponent), results in an infinite-orderpolynomial. An annihilator operator...
Newton polynomial, named after its inventor Isaac Newton, is an interpolation polynomial for a given set of data points. The Newton polynomial is sometimes...
Quasi-polynomial time algorithms are algorithms whose running time exhibits quasi-polynomial growth, a type of behavior that may be slower than polynomial time...
In numerical analysis, the Lagrange interpolating polynomial is the unique polynomial of lowest degree that interpolates a given set of data. Given a...
of the exponential of a homogeneous polynomial in n variables may depend only on SL(n)-invariants of the polynomial. One such invariant is the discriminant...
the polynomial division algorithm by specifying an initial shift register value, a final Exclusive-Or step and, most critically, a bit ordering (endianness)...