Search Results for ""

The (weak) Bruhat graph B_n of order n is the simple graph having have all permutations of {1,2,...,n} as vertices, and with an edge between pairs of permutations that differ ...

Cayley's cubic surface is the unique cubic surface having four ordinary double points (Hunt), the maximum possible for cubic surface (Endraß). The Cayley cubic is invariant ...

The word "class" has many specialized meanings in mathematics in which it refers to a group of objects with some common property (e.g., characteristic class or conjugacy ...

Condorcet's jury theorem states that given a group of voters (a "jury") independently choosing by majority vote between a correct outcome with probability 0<=p<=1 and an ...

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 ...