Search Results for ""

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 ...

Wang's conjecture states that if a set of tiles can tile the plane, then they can always be arranged to do so periodically (Wang 1961). The conjecture was refuted when Berger ...

The transitive reduction of a binary relation R on a set X is the minimum relation R^' on X with the same transitive closure as R. Thus aR^'b for any elements a and b of X, ...

A well-covered graph is a graph for which every minimal vertex cover has the same size, which is equivalent to every maximal independent vertex set being the same size. It is ...

If a is an element of a field F over the prime field P, then the set of all rational functions of a with coefficients in P is a field derived from P by adjunction of a.

A three-dimensional data set consisting of stacked two-dimensional data slices as a function of a third coordinate.

One of the Eilenberg-Steenrod axioms which states that, if X is a space with subspaces A and U such that the set closure of A is contained in the interior of U, then the ...

The fifth of Peano's axioms, which states: If a set S of numbers contains zero and also the successor of every number in S, then every number is in S.

n sets of s trials each, with the probability of success p constant in each set. var(x/n)=spq+s(s-1)sigma_p^2, where sigma_p^2 is the variance of p_i.