Search Results for ""

A subset S of a topological space X is compact if for every open cover of S there exists a finite subcover of S.

A compactification of a topological space X is a larger space Y containing X which is also compact. The smallest compactification is the one-point compactification. For ...

Let K subset V subset S^3 be a knot that is geometrically essential in a standard embedding of the solid torus V in the three-sphere S^3. Let K_1 subset S^3 be another knot ...

The companion matrix to a monic polynomial a(x)=a_0+a_1x+...+a_(n-1)x^(n-1)+x^n (1) is the n×n square matrix A=[0 0 ... 0 -a_0; 1 0 ... 0 -a_1; 0 1 ... 0 -a_2; | | ... ... |; ...

Suppose <= is a partial ordering on a nonempty set A. Then the elements a,b in A are said to be comparable provided a<=b or b<=a. Because two elements in a partially ordered ...

Given a set S with a subset E, the complement (denoted E^' or E^_) of E with respect to S is defined as E^'={F:F in S,F not in E}. (1) Using set difference notation, the ...

If k is the elliptic modulus of an elliptic integral or elliptic function, then k^'=sqrt(1-k^2) (1) is called the complementary modulus. Complete elliptic integrals with ...

A complemented lattice is an algebraic structure (L, ^ , v ,0,1,^') such that (L, ^ , v ,0,1) is a bounded lattice and for each element x in L, the element x^' in L is a ...

A labeled binary tree containing the labels 1 to n with root 1, branches leading to nodes labeled 2 and 3, branches from these leading to 4, 5 and 6, 7, respectively, and so ...

A partially ordered set (or ordered set or poset for short) (L,<=) is called a complete lattice if every subset M of L has a least upper bound (supremum, supM) and a greatest ...