Search Results for ""

A graph with a finite number of nodes and edges. If it has n nodes and has no multiple edges or graph loops (i.e., it is simple), it is a subgraph of the complete graph K_n. ...

An anyon is a projective representation of a Lie group.

Let G be a group with normal series (A_0, A_1, ..., A_r). A normal factor of G is a quotient group A_(k+1)/A_k for some index k<r. G is a solvable group iff all normal ...

The identity element of an additive group G, usually denoted 0. In the additive group of vectors, the additive identity is the zero vector 0, in the additive group of ...

The commutator subgroup (also called a derived group) of a group G is the subgroup generated by the commutators of its elements, and is commonly denoted G^' or [G,G]. It is ...

The number of elements of a group in a given conjugacy class.

If a matrix group is reducible, then it is completely reducible, i.e., if the matrix group is equivalent to the matrix group in which every matrix has the reduced form ...

An automorphism of a graph is a graph isomorphism with itself, i.e., a mapping from the vertices of the given graph G back to vertices of G such that the resulting graph is ...

A homogeneous space M is a space with a transitive group action by a Lie group. Because a transitive group action implies that there is only one group orbit, M is isomorphic ...

A group of sociable numbers of order 3.