Search Results for ""

Given a collection of sets, a member set that is not a proper subset of another member set is called a minimal set. Minimal sets are important in graph theory, since many ...

A tensor having contravariant and covariant indices.

Let rho(x)dx be the fraction of time a typical dynamical map orbit spends in the interval [x,x+dx], and let rho(x) be normalized such that int_0^inftyrho(x)dx=1 over the ...

The series which arises in the binomial theorem for negative integer -n, (x+a)^(-n) = sum_(k=0)^(infty)(-n; k)x^ka^(-n-k) (1) = sum_(k=0)^(infty)(-1)^k(n+k-1; k)x^ka^(-n-k) ...

A base for a neighborhood system of a point x is a collection N of open sets such that x belongs to every member of N, and any open set containing x also contains a member of ...

Numerical integration is the approximate computation of an integral using numerical techniques. The numerical computation of an integral is sometimes called quadrature. ...

The octahemioctacron is the dual polyhedron of the octahemioctahedron U_3 and Wenninger dual W_(68). When rendered, the octahemioctacron and hexahemioctacron appear the same.

A set of maximum degree to which all other degrees of recursively enumerable sets can be one-one reduced. If set A is many-one complete, then it is one-one complete, and vice ...

A topology defined on a totally ordered set X whose open sets are all the finite intersections of subsets of the form {x in X|x>a} or {x in X|x<a}, where a in X. The order ...

Let A be a C^*-algebra, then an element u in A is called a partial isometry if uu^*u=u.