Search Results for ""

An even permutation is a permutation obtainable from an even number of two-element swaps, i.e., a permutation with permutation symbol equal to +1. For initial set {1,2,3,4}, ...

Given a subset K of a vector space X, a nonempty subset S subset K is called an extreme set of K if no point of S is an internal point of any line interval whose endpoints ...

Let S be a nonempty set, then a filter on S is a nonempty collection F of subsets of S having the following properties: 1. emptyset not in F, 2. If A,B in F, then A ...

The fourth group isomorphism theorem, also called the lattice group isomorphism theorem, lets G be a group and let N⊴G, where N⊴G indicates that N is a normal subgroup of G. ...

Let L be an extension field of K, denoted L/K, and let G be the set of automorphisms of L/K, that is, the set of automorphisms sigma of L such that sigma(x)=x for every x in ...

If X is a locally compact T2-space, then the set C_ degrees(X) of all continuous complex valued functions on X vanishing at infinity (i.e., for each epsilon>0, the set {x in ...

The geometric span is largest possible distance between two points drawn from a finite set of points. It is therefore closely related to the generalized diameter of a closed ...

A triple (a,b,c) of positive integers satisfying a<b<c is said to be geometric if ac=b^2. In particular, such a triple is geometric if its terms form a geometric sequence ...

A decomposition of a module into a direct sum of submodules. The index set for the collection of submodules is then called the grading set. Graded modules arise naturally in ...

Let V(G) be the vertex set of a simple graph and E(G) its edge set. Then a graph isomorphism from a simple graph G to a simple graph H is a bijection f:V(G)->V(H) such that ...