Search Results for ""

A prolate spheroid is a spheroid that is "pointy" instead of "squashed," i.e., one for which the polar radius c is greater than the equatorial radius a, so c>a (called ...

The set of all zero-systems of a group G is denoted B(G) and is called the block monoid of G since it forms a commutative monoid under the operation of zero-system addition ...

A braid index is the least number of strings needed to make a closed braid representation of a link. The braid index is equal to the least number of Seifert circles in any ...

An algorithm which can be used to find a good, but not necessarily minimal, edge or vertex coloring for a graph. However, the algorithm does minimally color complete ...

Let O be an order of an imaginary quadratic field. The class equation of O is the equation H_O=0, where H_O is the extension field minimal polynomial of j(O) over Q, with ...

The Davenport constant of a finite Abelian group G is defined to be the length of the longest minimal zero-system of G and is denoted D(G). Symbolically, ...

An edge cover is a subset of edges defined similarly to the vertex cover (Skiena 1990, p. 219), namely a collection of graph edges such that the union of edge endpoints ...

Let G be a group and S be a topological G-set. Then a closed subset F of S is called a fundamental domain of G in S if S is the union of conjugates of F, i.e., S= union _(g ...

A matchstick graph is a simple graph which has a graph embedding that is planar, for which all distances between vertices have unit distance, and which is non-degenerate (so ...

Several cylindrical equidistant projections were devised by R. Miller. Miller's projections have standard parallels of phi_1=37 degrees30^' (giving minimal overall scale ...