Search Results for ""

For a partial order, the size of the longest antichain is called the width.

Let A be a finite-dimensional power-associative algebra, then A is the vector space direct sum A=A_(11)+A_(10)+A_(01)+A_(00), where A_(ij), with i,j=0,1 is the subspace of A ...

If all elements a_(ij) of an irreducible matrix A are nonnegative, then R=minM_lambda is an eigenvalue of A and all the eigenvalues of A lie on the disk |z|<=R, where, if ...

The motion along a phase curve as a function of time (Tabor 1989, p. 14).

An adjoint curve which bears a special relation to the base curve.

Every bounded operator T acting on a Hilbert space H has a decomposition T=U|T|, where |T|=(T^*T)^(1/2) and U is a partial isometry. This decomposition is called polar ...

The breaking up of self-intersecting polygons into simple polygons (illustrated above) is also called tessellation (Woo et al. 1999).

A polygrammic prism is a prism formed by two regular polygrams offset along their symmetry axis and with corresponding edges connected by lateral faces. The hexagrammic prism ...

An n-polyhedral graph (sometimes called a c-net) is a 3-connected simple planar graph on n nodes. Every convex polyhedron can be represented in the plane or on the surface of ...

Lachlan's terms for a collection of n points.