TOPICS
Search

Search Results for ""


1501 - 1510 of 2846 for Maximum Modulus TheoremSearch Results
A Cantor set C in R^3 is said to be scrawny if for each neighborhood U of an arbitrary point p in C, there is a neighborhood V of p such that every map f:S^1->V subset C ...
A formula of first-order logic is said to be in Skolemized form (sometimes also called Skolem standard form or universal form) if it is of the form forall x_1... forall x_nM, ...
The ordinal number of a value in a list arranged in a specified order (usually decreasing).
A symmetric design is a block design (v, k, lambda, r, b) with the same number of blocks as points, so b=v (or, equivalently, r=k). An example of a symmetric block design is ...
For every module M over a unit ring R, the tensor product functor - tensor _RM is a covariant functor from the category of R-modules to itself. It maps every R-module N to N ...
The radial curve of the tractrix x = a(t-tanht) (1) y = asecht (2) with radiant point (x_0,y_0) is the kappa curve x_r = x_0+atanht (3) y_r = y_0+asinhttanht. (4)
Let A be a C^*-algebra, then two element a,b of A are called unitarily equivalent if there exists a unitary u in A such that b=uau^*.
A weighted graph is a graph in which each branch is given a numerical weight. A weighted graph is therefore a special type of labeled graph in which the labels are numbers ...
n-plex is defined as 10^n.
A theory is decidable iff there is an algorithm which can determine whether or not any sentence r is a member of the theory.
1 ... 148|149|150|151|152|153|154 ... 285 Previous Next

...