Search Results for ""

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

A minimum edge cover is an edge cover having the smallest possible number of edges for a given graph. The size of a minimum edge cover of a graph is known as the edge cover ...

Bubbles can meet only at angles of 120 degrees (for three bubbles) and cos^(-1)(-1/3) approx 109 degrees28^'16^('') (for four bubbles), where cos^(-1)(-1/3) is the ...

An orientable surface with one boundary component such that the boundary component of the surface is a given knot K. In 1934, Seifert proved that such a surface can be ...

Define the minimal bounding rectangle as the smallest rectangle containing a given lattice polygon. If the perimeter of the lattice polygon is equal to that of its minimal ...

The phrase Tomita-Takesaki theory refers to a specific collection of results proven within the field of functional analysis regarding the theory of modular Hilbert algebras ...

A "weird number" is a number that is abundant (i.e., the sum of proper divisors is greater than the number) without being pseudoperfect (i.e., no subset of the proper ...

The Brinkmann graph (misspelled by Cancela et al. (2004) as "Brinkman") is a weakly regular quartic graph on 21 vertices and 42 edges. It was first mentioned in Brinkmann ...