Search Results for ""

There are three types of cubic lattices corresponding to three types of cubic close packing, as summarized in the following table. Now that the Kepler conjecture has been ...

The Danzer graph is the Levi graph of the Danzer configuration (Boben et al. 2015). It has 70 vertices and 140 edges and is quartic, bipartite, self-dual, and unit-distance. ...

Given a "good" graph G (i.e., one for which all intersecting graph edges intersect in a single point and arise from four distinct graph vertices), the crossing number is the ...

Given two intersecting lines or line segments, the amount of rotation about the point of intersection (the vertex) required to bring one into correspondence with the other is ...

The distance between two points is the length of the path connecting them. In the plane, the distance between points (x_1,y_1) and (x_2,y_2) is given by the Pythagorean ...

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

Surface area is the area of a given surface. Roughly speaking, it is the "amount" of a surface (i.e., it is proportional to the amount of paint needed to cover it), and has ...

Construct a chain C of 2n components in a solid torus V. Now thicken each component of C slightly to form a chain C_1 of 2n solid tori in V, where pi_1(V-C_1)=pi_1(V-C) via ...

All triangles are bicentric, i.e., possess both an incircle and a circumcircle. This is not necessarily the case for polygons with four or more sides. The inradius r and ...

Complex infinity is an infinite number in the complex plane whose complex argument is unknown or undefined. Complex infinity may be returned by the Wolfram Language, where it ...