Search Results for ""
1141 - 1150 of 13134 for Naive set theorySearch Results
A tetrahedral ring is a term given in this work to a set of n regular tetrahedra joined face-to-face sharing a common edge (with internal conjoined faces removed). These ...
An n-tuple, sometimes simply called a "tuple" when the number n is known implicitly, is another word for a list, i.e., an ordered set of n elements. It can be interpreted as ...
A set of numbers obeying a pattern like the following: 91·37 = 3367 (1) 9901·3367 = 33336667 (2) 999001·333667 = 333333666667 (3) 99990001·33336667 = 3333333366666667 (4) 4^2 ...
Each row and each column in the group multiplication table lists each of the group elements once and only once. From this, it follows that no two elements may be in the ...
The arithmetic mean of a set of values is the quantity commonly called "the" mean or the average. Given a set of samples {x_i}, the arithmetic mean is x^_=1/Nsum_(i=1)^Nx_i. ...
The convex hull of a set of points S in n dimensions is the intersection of all convex sets containing S. For N points p_1, ..., p_N, the convex hull C is then given by the ...
A hash function H projects a value from a set with many (or even an infinite number of) members to a value from a set with a fixed number of (fewer) members. Hash functions ...
For a normed space (X,||·||), define X^~ to be the set of all equivalent classes of Cauchy sequences obtained by the relation {x_n}∼{y_n} if and only if lim_(n)||x_n-y_n||=0. ...
If any set of points is displaced by X^idx_i where all distance relationships are unchanged (i.e., there is an isometry), then the vector field is called a Killing vector. ...
A function f in C^infty(R^n) is called a Schwartz function if it goes to zero as |x|->infty faster than any inverse power of x, as do all its derivatives. That is, a function ...
...
View search results from all Wolfram sites (53007 matches)

