Search Results for ""

The group algebra K[G], where K is a field and G a group with the operation *, is the set of all linear combinations of finitely many elements of G with coefficients in K, ...

A cycle graph of a group is a graph which shows cycles of a group as well as the connectivity between the cycles. Such graphs are constructed by drawing labeled nodes, one ...

An extension of a group H by a group N is a group G with a normal subgroup M such that M=N and G/M=H. This information can be encoded into a short exact sequence of groups ...

A presentation of a group is a description of a set I and a subset R of the free group F(I) generated by I, written <(x_i)_(i in I)|(r)_(r in R)>, where r=1 (the identity ...

The gyrate rhombicosidodecahedron is a convex equilateral solid obtained by rotating one of the pentagonal cupolas of a small rhombicosidodecahedron by 1/10 of a turn. It is ...

The gyrobifastigium is an octahedron with on 8 vertices, 14 edges, and 8 faces. The equilateral gyrobifastigium is Johnson solid J_(26), consisting of two triangular prisms ...

A graph is said to be H^*-connected if it is either Hamilton-connected or Hamilton-laceable. S. Wagon (pers. comm., May. 20, 2013; Dupuis and Wagon 2014) conjecture that all ...

Hackenbush is a game in combinatorial game theory in which player Left can delete any bLue edge, player Right can delete any Red edge, and either player can delete Green ...

Let f be an entire function of finite order lambda and {a_j} the zeros of f, listed with multiplicity, then the rank p of f is defined as the least positive integer such that ...

The Hadamard product is a representation for the Riemann zeta function zeta(s) as a product over its nontrivial zeros rho, ...