Search Results for ""

A procedure for decomposing an N×N matrix A into a product of a lower triangular matrix L and an upper triangular matrix U, LU=A. (1) LU decomposition is implemented in the ...

The Laplacian spectral radius of a finite graph is defined as the largest value of its Laplacian spectrum, i.e., the largest eigenvalue of the Laplacian matrix (Lin et al. ...

Lattice theory is the study of sets of objects known as lattices. It is an outgrowth of the study of Boolean algebras, and provides a framework for unifying the study of ...

With a large enough sample, any outrageous thing is likely to happen (Diaconis and Mosteller 1989). Littlewood (1986) considered an event which occurs one in a million times ...

Let S be a nonempty set of real numbers that has an upper bound. Then a number c is called the least upper bound (or the supremum, denoted supS) for S iff it satisfies the ...

The Lebesgue integral is defined in terms of upper and lower bounds using the Lebesgue measure of a set. It uses a Lebesgue sum S_n=sum_(i)eta_imu(E_i) where eta_i is the ...

The Lemoine ellipse is an inconic (that is always an ellipse) that has inconic parameters x:y:z=(2(b^2+c^2)-a^2)/(bc):(2(a^2+c^2)-b^2)/(ac): (2(a^2+b^2)-c^2)/(ab). (1) The ...

Let L denote the partition lattice of the set {1,2,...,n}. The maximum element of L is M={{1,2,...,n}} (1) and the minimum element is m={{1},{2},...,{n}}. (2) Let Z_n denote ...

A level set in two dimensions. Phase curves are sometimes also known as level curves (Tabor 1989, p. 14).

A fractal curve, also called the C-curve (Gosper 1972). The base curve and motif are illustrated below. Duvall and Keesling (1999) proved that the Hausdorff dimension of the ...