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

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

The generalized Petersen graph GP(n,k), also denoted P(n,k) (Biggs 1993, p. 119; Pemmaraju and Skiena 2003, p. 215), for n>=3 and 1<=k<=|_(n-1)/2_| is a connected cubic graph ...

Let Y_n denote the graph with vertex set V(X_n), where X_n is the n-hypercube and two vertices are adjacent in Y_n iff they are at distance 1<=d<=2 in X_n. Y_n is not ...

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 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 length is the longest dimension of an object.

For two lines in the plane with endpoints (x_1,x_2) and (x_3,x_4), the angle between them is given by costheta=((x_2-x_1)·(x_4-x_3))/(|x_2-x_1||x_4-x_3|). (1) The angle theta ...

A linear code over a finite field with q elements F_q is a linear subspace C subset F_q^n. The vectors forming the subspace are called codewords. When codewords are chosen ...