Search Results for ""

A relation < is a strict order on a set S if it is 1. Irreflexive: a<a does not hold for any a in S. 2. Asymmetric: if a<b, then b<a does not hold. 3. Transitive: a<b and b<c ...

A tensor category (C, tensor ,I,a,r,l) is strict if the maps a, l, and r are always identities. A related notion is that of a tensor R-category.

A noncylindrical ruled surface always has a parameterization of the form x(u,v)=sigma(u)+vdelta(u), (1) where |delta|=1, sigma^'·delta^'=0, and sigma is called the striction ...

Let P=(P,<=) be a partially ordered set, and let x,y,z in P. If x<=y<=z, then y is said to be between x and z. If y is between x and z and y not in {x,z}, then y is strictly ...

A function f(x) is said to be strictly decreasing on an interval I if f(b)<f(a) for all b>a, where a,b in I. On the other hand, if f(b)<=f(a) for all b>a, the function is ...

A function f(x) is said to be strictly increasing on an interval I if f(b)>f(a) for all b>a, where a,b in I. On the other hand, if f(b)>=f(a) for all b>a, the function is ...

A lower triangular matrix having 0s along the diagonal as well as the upper portion, i.e., a matrix A=[a_(ij)] such that a_(ij)=0 for i<=j. Written explicitly, L=[0 0 ... 0; ...

A strictly upper triangular matrix is an upper triangular matrix having 0s along the diagonal as well as the lower portion, i.e., a matrix A=[a_(ij)] such that a_(ij)=0 for ...

A string of length n on an alphabet l of m characters is an arrangement of n not necessarily distinct symbols from l. There are m^n such distinct strings. For example, the ...

A string figure is any pattern produced when a looped string is spanned between two hands and is twisted and woven in various manners around the fingers and the wrists. The ...