Search Results for ""

A set function mu possesses countable additivity if, given any countable disjoint collection of sets {E_k}_(k=1)^n on which mu is defined, mu( union ...

Let X be a set and S a collection of subsets of X. A set function mu:S->[0,infty] is said to possess countable monotonicity provided that, whenever a set E in S is covered by ...

Any set which can be put in a one-to-one correspondence with the natural numbers (or integers) so that a prescription can be given for identifying its members one at a time ...

A positive integer: 1, 2, 3, 4, ... (OEIS A000027), also called a natural number. However, zero (0) is sometimes also included in the list of counting numbers. Due to lack of ...

A condition in numerical equation solving which states that, given a space discretization, a time step bigger than some computable quantity should not be taken. The condition ...

A covering map (also called a covering or projection) is a surjective open map f:X->Y that is locally a homeomorphism, meaning that each point in X has a neighborhood that is ...

The coversine is a little-used entire trigonometric function defined by covers(z) = versin(1/2pi-z) (1) = 1-sinz, (2) where versin(z) is the versine and sinz is the sine. The ...

A labeled graph whose nodes are indexed by the generators of a Coxeter group having (P_i,P_j) as an graph edge labeled by M_(ij) whenever M_(ij)>2, where M_(ij) is an element ...

The complex lattice Lambda_6^omega corresponding to real lattice K_(12) having the densest hypersphere packing (kissing number) in twelve dimensions. The associated ...

A group generated by the elements P_i for i=1, ..., n subject to (P_iP_j)^(M_(ij))=1, where M_(ij) are the elements of a Coxeter matrix. Coxeter used the notation [3^(p,q,r)] ...