Search Results for ""

A well ordered set of monomials which also satisfies the condition "u<v implies uw<vw" for all monomials u, v, and w. Examples of monomial orders are the lexicographic order ...

A multilinear form on a vector space V(F) over a field F is a map f:V(F)×...×V(F)->F (1) such that c·f(u_1,...,u_i,...,u_n)=f(u_1,...,c·u_i,...,u_n) (2) and ...

A nonuniform rational B-spline surface of degree (p,q) is defined by ...

Neville's algorithm is an interpolation algorithm which proceeds by first fitting a polynomial of degree 0 through the point (x_k,y_k) for k=1, ..., n, i.e., P_k(x)=y_k. A ...

An algebraic surface of degree eight. The maximum number of ordinary double points known to exist on an octic surface is 168 (the Endraß octics), although the rigorous upper ...

A set of maximum degree to which all other degrees of recursively enumerable sets can be one-one reduced. If set A is many-one complete, then it is one-one complete, and vice ...

The number of outward directed graph edges from a given graph vertex in a directed graph.

If a polynomial P(x) has a root x=a, i.e., if P(a)=0, then x-a is a factor of P(x).

A quadratic polynomial is a polynomial of degree 2. A univariate quadratic polynomial has the form f(x)=a_2x^2+a_1x+a_0. An equation involving a quadratic polynomial is ...

A quadratic recurrence is a recurrence equation on a sequence of numbers {x_n} expressing x_n as a second-degree polynomial in x_k with k<n. For example, x_n=x_(n-1)x_(n-2) ...