Search Results for ""

For a logarithmic spiral given parametrically as x = ae^(bt)cost (1) y = ae^(bt)sint, (2) evolute is given by x_e = -abe^(bt)sint (3) y_e = abe^(bt)cost. (4) As first shown ...

The function z=f(x)=ln(x/(1-x)). (1) This function has an inflection point at x=1/2, where f^('')(x)=(2x-1)/(x^2(x-1)^2)=0. (2) Applying the logit transformation to values ...

The Lucas cubic is a pivotal isotomic cubic having pivot point at Kimberling center X_(69), the isogonal conjugate of the orthocenter, i.e., the locus of points P such that ...

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