Search Results for ""

The singleton set {0}, with respect to the trivial group structure defined by the addition 0+0=0. The element 0 is the additive identity element of the group, and also the ...

The constant polynomial P(x)=0 whose coefficients are all equal to 0. The corresponding polynomial function is the constant function with value 0, also called the zero map. ...

A group is called k-transitive group if there exists a set of elements on which the group acts faithfully and k-transitively. It should be noted that transitivity computed ...

The word net has several meanings in mathematics. It refers to a plane diagram in which the polyhedron edges of a polyhedron are shown, a point set satisfying certain ...

The n-crown graph for an integer n>=3 is the graph with vertex set {x_0,x_1,...,x_(n-1),y_0,y_1,...,y_(n-1)} (1) and edge set {(x_i,y_j):0<=i,j<=n-1,i!=j}. (2) It is ...

Let x be a real number, and let R be the set of positive real numbers mu for which 0<|x-p/q|<1/(q^mu) (1) has (at most) finitely many solutions p/q for p and q integers. Then ...

A tree is a mathematical structure that can be viewed as either a graph or as a data structure. The two views are equivalent, since a tree data structure contains not only a ...

An affine variety V is an algebraic variety contained in affine space. For example, {(x,y,z):x^2+y^2-z^2=0} (1) is the cone, and {(x,y,z):x^2+y^2-z^2=0,ax+by+cz=0} (2) is a ...

Let |A| denote the cardinal number of set A, then it follows immediately that |A union B|=|A|+|B|-|A intersection B|, (1) where union denotes union, and intersection denotes ...

A connected bipartite graph is called Hamilton-laceable, a term apparently introduced in Simmons (1978), if it has a u-v Hamiltonian path for all pairs of vertices u and v, ...