Search Results for ""

In the case of a general surface, the distance between two points measured along the surface is known as a geodesic. For example, the shortest distance between two points on ...

A map projection obtained by projecting points P on the surface of sphere from the sphere's north pole N to point P^' in a plane tangent to the south pole S (Coxeter 1969, p. ...

The wallpaper groups are the 17 possible plane symmetry groups. They are commonly represented using Hermann-Mauguin-like symbols or in orbifold notation (Zwillinger 1995, p. ...

The toroidal crossing number cr_(1)(G) of a graph G is the minimum number of crossings with which G can be drawn on a torus. A planar graph has toroidal crossing number 0, ...

A unit-distance graph is a distance graph having an embedding in the Euclidean plane (unit-distance embedding) in which vertices are distinct points and all edges are of ...

Gaussian primes are Gaussian integers z=a+bi satisfying one of the following properties. 1. If both a and b are nonzero then, a+bi is a Gaussian prime iff a^2+b^2 is an ...

The Golomb graph is a unit-distance graph discovered around 1960-1965 by Golomb (Soifer 2008, p. 19). It is implemented in the Wolfram Language as GraphData["GolombGraph"]. A ...

In the fields of functional and harmonic analysis, the Littlewood-Paley decomposition is a particular way of decomposing the phase plane which takes a single function and ...

A random walk is a sequence of discrete steps in which each step is randomly taken subject to some set of restrictions in allowed directions and step lengths. Random walks ...

The tangent plane to a surface at a point p is the tangent space at p (after translating to the origin). The elements of the tangent space are called tangent vectors, and ...