Search Results for ""

The "kurtosis excess" (Kenney and Keeping 1951, p. 27) is defined in terms of the usual kurtosis by gamma_2 = beta_2-3 (1) = (mu_4)/(mu_2^2)-3. (2) It is commonly denoted ...

Let lim stand for the limit lim_(x->c), lim_(x->c^-), lim_(x->c^+), lim_(x->infty), or lim_(x->-infty), and suppose that lim f(x) and lim g(x) are both zero or are both ...

A lattice reduction algorithm, named after discoverers Lenstra, Lenstra, and Lovasz (1982), that produces a lattice basis of "short" vectors. It was noticed by Lenstra et al. ...

A labeled graph G=(V,E) is a finite series of graph vertices V with a set of graph edges E of 2-subsets of V. Given a graph vertex set V_n={1,2,...,n}, the number of ...

The Lagrange interpolating polynomial is the polynomial P(x) of degree <=(n-1) that passes through the n points (x_1,y_1=f(x_1)), (x_2,y_2=f(x_2)), ..., (x_n,y_n=f(x_n)), and ...

Let z be defined as a function of w in terms of a parameter alpha by z=w+alphaphi(z). (1) Then Lagrange's inversion theorem, also called a Lagrange expansion, states that any ...

A Laman graph is a graph satisfying Laman's theorem. In other words, it is a graph G have exactly 2n-3 graph edges, where n is the number of graph vertices in G and for which ...

A Lambert series is a series of the form F(x)=sum_(n=1)^inftya_n(x^n)/(1-x^n) (1) for |x|<1. Then F(x) = sum_(n=1)^(infty)a_nsum_(m=1)^(infty)x^(mn) (2) = ...

Landau's function g(n) is the maximum order of an element in the symmetric group S_n. The value g(n) is given by the largest least common multiple of all partitions of the ...

Landau's problems are the four "unattackable" problems mentioned by Landau in the 1912 Fifth Congress of Mathematicians in Cambridge, namely: 1. The Goldbach conjecture, 2. ...