Search Results for ""
281 - 290 of 3143 for Totally Ordered SetSearch Results
A planted plane tree (V,E,v,alpha) is defined as a vertex set V, edges set E, root v, and order relation alpha on V which satisfies 1. For x,y in V if rho(x)<rho(y), then ...
A monotonic function is a function which is either entirely nonincreasing or nondecreasing. A function is monotonic if its first derivative (which need not be continuous) ...
A set of m distinct positive integers S={a_1,...,a_m} satisfies the Diophantus property D(n) of order n (a positive integer) if, for all i,j=1, ..., m with i!=j, ...
A function element is an ordered pair (f,U) where U is a disk D(Z_0,r) and f is an analytic function defined on U. If W is an open set, then a function element in W is a pair ...
A set considered together with the sigma-algebra on the set.
The group direct sum of a sequence {G_n}_(n=0)^infty of groups G_n is the set of all sequences {g_n}_(n=0)^infty, where each g_n is an element of G_n, and g_n is equal to the ...
The descending chain condition, commonly abbreviated "D.C.C.," is the dual notion of the ascending chain condition. The descending chain condition for a partially ordered set ...
A set of two numbers or objects linked in some way is said to be a pair. The pair a and b is usually denoted (a, b), and is generally considered to be ordered, making it a ...
An orthogonal array OA(k,s) is a k×s^2 array with entries taken from an s-set S having the property that in any two rows, each ordered pair of symbols from S occurs exactly ...
A partial function is a function that is not total.
...
View search results from all Wolfram sites (37867 matches)

