Search Results for ""

The (n+1)×(n+1) tridiagonal matrix (also called the Clement matrix) defined by S_n=[0 n 0 0 ... 0; 1 0 n-1 0 ... 0; 0 2 0 n-2 ... 0; | | ... ... ... |; 0 0 0 n-1 0 1; 0 0 0 0 ...

The function K_n(x_0,x)=K_n(x,x_0)^_=K_n(x^_,x^__0) which is useful in the study of many polynomials.

The Kummer surfaces are a family of quartic surfaces given by the algebraic equation (x^2+y^2+z^2-mu^2w^2)^2-lambdapqrs=0, (1) where lambda=(3mu^2-1)/(3-mu^2), (2) p, q, r, ...

A type of statistic which can be useful for determining asymmetry and tailedness of a population.

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

The orthogonal decomposition of a matrix into lower trapezoidal matrices.

A nonlinear deconvolution technique used in deconvolving images from the Hubble Space Telescope before corrective optics were installed.

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

Quantifies deviation from translational invariance by describing the distribution of gaps within a set at multiple scales. The more lacunar a set, the more heterogeneous the ...

Let z=re^(itheta)=x+iy be a complex number, then inequality |(zexp(sqrt(1-z^2)))/(1+sqrt(1-z^2))|<=1 (1) holds in the lens-shaped region illustrated above. Written explicitly ...