TOPICS
Search

Search Results for ""


531 - 540 of 1780 for SetsSearch Results
If f is continuous on a closed interval [a,b], and c is any number between f(a) and f(b) inclusive, then there is at least one number x in the closed interval such that ...
A linear extension of a partially ordered set P is a permutation of the elements p_1, p_2, ... of P such that p_i<p_j implies i<j. For example, the linear extensions of the ...
A locus is the set of all points (usually forming a curve or surface) satisfying some condition. For example, the locus of points in the plane equidistant from a given point ...
Let I be a set, and let U be an ultrafilter on I, let phi be a formula of a given language L, and let {A_i:i in I} be any collection of structures which is indexed by the set ...
Let (A,<=) be a partially ordered set. Then an element m in A is said to be maximal if, for all a in A, m!<=a. Alternatively, an element m in A is maximal such that if m<=a ...
A set of vectors is maximally linearly independent if including any other vector in the vector space would make it linearly dependent (i.e., if any other vector in the space ...
For some range of r, the Mandelbrot set lemniscate L_3 in the iteration towards the Mandelbrot set is a pear-shaped curve. In Cartesian coordinates with a constant r, the ...
Let V be a variety, and write G(V) for the set of divisors, G_l(V) for the set of divisors linearly equivalent to 0, and G_a(V) for the group of divisors algebraically equal ...
The set of all Schwartz functions is called a Schwartz space and is denoted S(R^n). If C_0^infty(R^n) denotes the set of smooth functions of compact support on R^n, then this ...
A sorting algorithm which makes n passes over a set of n elements, in each pass selecting the smallest element and deleting it from the set. This algorithm has running time ...
1 ... 51|52|53|54|55|56|57 ... 178 Previous Next

...