Search Results for ""
5211 - 5220 of 13134 for complexity theorySearch Results
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.
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 ...
U_n(f)=int_a^bf(x)K_n(x)dx, where {K_n(x)} is a sequence of continuous functions.
An unsolved problem in mathematics attributed to Lehmer (1933) that concerns the minimum Mahler measure M_1(P) for a univariate polynomial P(x) that is not a product of ...
...
View search results from all Wolfram sites (28442 matches)

