Search Results for ""

The lower matching number of a graph is the minimum size of a maximal independent edge set. The (upper) matching number may be similarly defined as the largest size of an ...

The Lucas central circle is the circumcircle of the Lucas central triangle. The center, radius, and circle function appear to be complicated, and neither the center nor the ...

Given a Lyapunov characteristic exponent sigma_i, the corresponding Lyapunov characteristic number lambda_i is defined as lambda_i=e^(sigma_i). (1) For an n-dimensional ...

A robust estimation based on maximum likelihood arguments.

The winding number W(theta) of a map f(theta) with initial value theta is defined by W(theta)=lim_(n->infty)(f^n(theta)-theta)/n, which represents the average increase in the ...

The eigenvalues of a matrix A are called its spectrum, and are denoted lambda(A). If lambda(A)={lambda_1,...,lambda_n}, then the determinant of A is given by ...

The mean tetrahedron volume V^_ is the average volume of a tetrahedron in tetrahedron picking within some given shape. As summarized in the following table, it is possible to ...

P_n(cosalpha)=(sqrt(2))/piint_0^alpha(cos[(n+1/2)phi])/(sqrt(cosphi-cosalpha))dphi, where P_n(x) is a Legendre polynomial.

Given a metric g_(alphabeta), the discriminant is defined by g = det(g_(alphabeta)) (1) = |g_(11) g_(12); g_(21) g_(22)| (2) = g_(11)g_(22)-(g_(12))^2. (3) Let g be the ...

Pathological functions that are continuous but differentiable only on a set of points of measure zero are sometimes known as monsters of real analysis. Examples include the ...