TOPICS
Search

Search Results for ""


341 - 350 of 1381 for Polyhedral groupSearch Results
The strongly embedded theorem identifies all simple groups with a strongly 2-embedded subgroup. In particular, it asserts that no simple group has a strongly 2-embedded ...
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 every p, the kernel of partial_p:C_p->C_(p-1) is called the group of cycles, Z_p={c in C_p:partial(c)=0}. (1) The letter Z is short for the German word for cycle, ...
The vierergruppe is the Abelian abstract group on four elements that is isomorphic to the finite group C2×C2 and the dihedral group D_2. The multiplication table of one ...
A basepoint is the beginning and ending point of a loop. The fundamental group of a topological space is always with respect to a particular choice of basepoint.
Let N be a nilpotent, connected, simply connected Lie group, and let D be a discrete subgroup of N with compact right quotient space. Then N/D is called a nilmanifold.
A formal mathematical theory which introduces "components at infinity" by defining a new type of divisor class group of integers of a number field. The divisor class group is ...
The wreathed product of the monster group by Z_2. The bimonster is a quotient of the Coxeter group with the above Coxeter-Dynkin diagram. This had been conjectured by Conway, ...
The Janko groups are the four sporadic groups J_1, J_2, J_3 and J_4. The Janko group J_2 is also known as the Hall-Janko group. The Janko groups are implemented in the ...
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 ...
1 ... 32|33|34|35|36|37|38 ... 139 Previous Next

...