Search Results for ""

The distance p (sometimes also denoted k) from the focus to the conic section directrix of a conic section. The following table gives the focal parameter for the different ...

Consider a finite collection of points p=(p_1,...,p_n), p_i in R^d Euclidean space (known as a configuration) and a graph G whose graph vertices correspond to pairs of points ...

The zeros of the derivative P^'(z) of a polynomial P(z) that are not multiple zeros of P(z) are the positions of equilibrium in the field of force due to unit particles ...

A binary Hamming code H_r of length n=2^r-1 (with r>=2) is a linear code with parity-check matrix H whose columns consist of all nonzero binary vectors of length r, each used ...

The Harborth graph is the smallest known 4-regular matchstick graph. It is therefore both planar and unit-distance. It has 104 edges and 52 vertices. This graph was named ...

A metric on a bunch of segments with a common endpoint O, which defines the distance between two points P_1 and P_2 as the length of the shortest path connecting them inside ...

A shell bounded by two similar ellipsoids having a constant ratio of axes. Given a chord passing through a homeoid, the distance between inner and outer intersections is ...

The circle with respect to which an inverse curve is computed or relative to which inverse points are computed. In three dimensions, inverse points can be computed relative ...

The radius used in performing an inversion with respect to an inversion circle.

The length is the longest dimension of an object.