Search Results for ""

The classification theorem of finite simple groups, also known as the "enormous theorem," which states that the finite simple groups can be classified completely into 1. ...

A notation used to describe curves. The fundamental principle of Clebsch-Aronhold notation states that if each of a number of forms be replaced by a power of a linear form in ...

A composite knot is a knot that is not a prime knot. Schubert (1949) showed that every knot can be uniquely decomposed (up to the order in which the decomposition is ...

Let a graph G=(V,E) be defined on vertex set V and edge set E. Then a construction sequence (or c-sequence) for G is a linear order on V union E in which each edge appears ...

A cross-handle is a topological structure which can be thought of as the object produced by puncturing a surface twice, attaching a zip around each puncture travelling in the ...

The cyclic group C_(10) is the unique Abelian group of group order 10 (the other order-10 group being the non-Abelian D_5). Examples include the integers modulo 10 under ...

The cyclic group C_(12) is one of the two Abelian groups of the five groups total of group order 12 (the other order-12 Abelian group being finite group C2×C6). Examples ...

C_6 is one of the two groups of group order 6 which, unlike D_3, is Abelian. It is also a cyclic. It is isomorphic to C_2×C_3. Examples include the point groups C_6 and S_6, ...

The cyclic group C_8 is one of the three Abelian groups of the five groups total of group order 8. Examples include the integers modulo 8 under addition (Z_8) and the residue ...

A (Delta,D)-graph is a graph with maximum vertex degree Delta and diameter at most D. The order of a graph with degree Delta of diameter D is bounded by ...