Search Results for ""

A polynomial function is a function whose values can be expressed in terms of a defining polynomial. A polynomial function of maximum degree 0 is said to be a constant ...

The l^infty-polynomial norm defined for a polynomial P=a_kx^k+...+a_1x+a_0 by ||P||_infty=max_(k)|a_k|. Note that some authors (especially in the area of Diophantine ...

A matrix whose entries are polynomials.

A triangle center is said to be polynomial iff there is a triangle center function f that is a polynomial in a, b, and c (Kimberling 1998, p. 46).

Lachlan's terms for a collection of n points.

A graph G is called d-polytopal if there exists a d-dimensional convex polytope P such that the vertices and edges of G are in a one-to-one incidence-preserving ...

There are 10 stellated regular 4-polytopes (Wells 1991, p. 209).

The ith Pontryagin class of a vector bundle is (-1)^i times the ith Chern class of the complexification of the vector bundle. It is also in the 4ith cohomology group of the ...

Let G be a locally compact Abelian group. Let G^* be the group of all continuous homeomorphisms G->R/Z, in the compact open topology. Then G^* is also a locally compact ...

A result in control theory. Define H(psi,x,u)=(psi,f(x,u))=sum_(a=0)^npsi_af^a(x,u). Then in order for a control u(t) and a trajectory x(t) to be optimal, it is necessary ...