Search Results for ""

There are at least two graphs associated with H. Walther. A graph on 25 vertices which appears somewhat similar to Tutte's fragment is implemented without discussion or ...

Let G be a finite graph and v a vertex of G. The stabilizer of v, stab(v), is the set of group elements {g in Aut(G)|g(v)=v}, where Aut(g) is the graph automorphism group. ...

For P, Q, R, and S polynomials in n variables [P·Q,R·S]=sum_(i_1,...,i_n>=0)A/(i_1!...i_n!), (1) where A=[R^((i_1,...,i_n))(D_1,...,D_n)Q(x_1,...,x_n) ...

Given a module M over a unit ring R, the set End_R(M) of its module endomorphisms is a ring with respect to the addition of maps, (f+g)(x)=f(x)+g(x), for all x in M, and the ...

The Krohn-Rhodes complexity, also called the group complexity or simply "the complexity," of a finite semigroup S is the smallest number of groups in a wreath product of ...

The power A^n of a matrix A for n a nonnegative integer is defined as the matrix product of n copies of A, A^n=A...A_()_(n). A matrix to the zeroth power is defined to be the ...

A group G is nilpotent if the upper central sequence 1=Z_0<=Z_1<=Z_2<=...<=Z_n<=... of the group terminates with Z_n=G for some n. Nilpotent groups have the property that ...

An irreducible algebraic integer which has the property that, if it divides the product of two algebraic integers, then it divides at least one of the factors. 1 and -1 are ...

A relation is any subset of a Cartesian product. For instance, a subset of A×B, called a "binary relation from A to B," is a collection of ordered pairs (a,b) with first ...

Suppose for every point x in a manifold M, an inner product <·,·>_x is defined on a tangent space T_xM of M at x. Then the collection of all these inner products is called ...