Search Results for ""

A connection game is a board game in which players compete to develop or complete a type of topological connection with their pieces. This could involve forming a path ...

The cross number of a zero-system sigma={g_1,g_2,...,g_n} of G is defined as K(sigma)=sum_(i=1)^n1/(|g_i|) The cross number of a group G has two different definitions. 1. ...

The cup product is a product on cohomology classes. In the case of de Rham cohomology, a cohomology class can be represented by a closed form. The cup product of [alpha] and ...

The deltoidal icositetrahedral graph is Archimedean dual graph which is the skeleton of the deltoidal icositetrahedron. It is implemented in the Wolfram Language as ...

The disdyakis dodecahedral graph is Archimedean dual graph which is the skeleton of the disdyakis dodecahedron. It is implemented in the Wolfram Language as ...

The disdyakis triacontahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...

A graph G is distance transitive if its automorphism group is transitive on pairs of vertices at each pairwise distance in the graph. Distance-transitivity is a ...

Endraß surfaces are a pair of octic surfaces which have 168 ordinary double points. This is the maximum number known to exist for an octic surface, although the rigorous ...

A mathematical structure first introduced by Kolyvagin (1990) and defined as follows. Let T be a finite-dimensional p-adic representation of the Galois group of a number ...

The Foster cage is one of the four (5,5)-cage graphs. Like the other (5,5)-cages, the Foster cage has 30 nodes. It has 75 edges, diameter 3, girth 5, chromatic number 4, and ...