Search Results for ""

A trace form on an arbitrary algebra A is a symmetric bilinear form (x,y) such that (xy,z)=(x,yz) for all x,y,z in A (Schafer 1996, p. 24).

A permutation group in which the permutations are limited to transpositions.

A vertex-transitive graph, also sometimes called a node symmetric graph (Chiang and Chen 1995), is a graph such that every pair of vertices is equivalent under some element ...

The zonal polynomials are a class of orthogonal polynomials. They are a special case of the Jack polynomials corresponding to the case alpha=2.

An alternating group is a group of even permutations on a set of length n, denoted A_n or Alt(n) (Scott 1987, p. 267). Alternating groups are therefore permutation groups. ...

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 ...

The eight Gell-Mann matrices lambda_i, i=1,...,8, are an example of the set of generators of the Lie algebra associated to the special unitary group SU(3). Explicitly, these ...

The generalized Gell-Mann matrices are the n^2-1 matrices generating the Lie algebra associated to the special unitary group SU(n), n>=2. As their name suggests, these ...

Let a tree S be a subgraph of a cubic graph G. The graph excision G circleminus S is the graph resulting from removing the tree, then merging the edges. For example, if in ...

A hexagon tiling is a tiling of the plane by identical hexagons. The regular hexagon forms a regular tessellation, also called a hexagonal grid, illustrated above. There are ...