Search Results for ""

An n-step Lucas sequence {L_k^((n))}_(k=1)^infty is defined by letting L_k^((n))=-1 for k<0, L_0^((n))=n, and other terms according to the linear recurrence equation ...

The M'Cay cubic Z(X_3) is a self-isogonal cubic given by the locus of all points whose pedal circle touches the nine-point circle, or equivalently, the locus of all points P ...

The MacBeath circumconic is the dual conic to the MacBeath inconic, introduced in Dec. 2004 by P. Moses (Kimberling). It has circumconic parameters x:y:z=cosA:cosB:cosC, (1) ...

For a polynomial P(x_1,x_2,...,x_k), the Mahler measure of P is defined by (1) Using Jensen's formula, it can be shown that for P(x)=aproduct_(i=1)^(n)(x-alpha_i), ...

An n×m matrix A^- is a 1-inverse of an m×n matrix A for which AA^-A=A. (1) The Moore-Penrose matrix inverse is a particular type of 1-inverse. A matrix equation Ax=b (2) has ...

A maximum spanning tree is a spanning tree of a weighted graph having maximum weight. It can be computed by negating the weights for each edge and applying Kruskal's ...

(1) where H_n(x) is a Hermite polynomial (Watson 1933; Erdélyi 1938; Szegö 1975, p. 380). The generating function ...

Midpoint augmentation, a term introduced here, is a variant of conventional augmentation in which each facial polygon is replaced by a triangular polygon joining vertices ...

The fundamental theorem of game theory which states that every finite, zero-sum, two-person game has optimal mixed strategies. It was proved by John von Neumann in 1928. ...

There exist lattices in n dimensions having hypersphere packing densities satisfying eta>=(zeta(n))/(2^(n-1)), where zeta(n) is the Riemann zeta function. However, the proof ...