Search Results for ""

Two sets T_1 and T_2 are called Wilf equivalent if they belong to the same Wilf class.

Wilker's inequalities state that 2+(16)/(pi^4)x^3tanx<(sin^2x)/(x^2)+(tanx)/x<2+2/(45)x^3tanx for 0<x<pi/2, where the constants 2/45 and 16/pi^4 are the best possible ...

Let phi(x_1,...,x_m) be an L_(exp) formula, where L_(exp)=L union {e^x} and L is the language of ordered rings L={+,-,·,<,0,1}. Then there exist n>=m and f_1,...,f_s in ...

The integral transform defined by (Kphi)(x) =int_(-infty)^inftyG_(p+2,q)^(m,n+2)(t|1-nu+ix,1-nu-ix,(a_p); (b_p))phi(t)dt, where G_(c,d)^(a,b) is the Meijer G-function.

A discrete fast Fourier transform algorithm which can be implemented for N=2, 3, 4, 5, 7, 8, 11, 13, and 16 points.

Constants gamma such that [int_Omega|f|^qdx]^(1/q)<=gamma[int_Omegasum_(i=1)^N|(partialf)/(partialx_i)|^pdx]^(1/p), where f is a real-valued smooth function on a region Omega ...

A witness is a number which, as a result of its number theoretic properties, guarantees either the compositeness or primality of a number n. Witnesses are most commonly used ...

The Woodbury formula (A+UV^(T))^(-1)=A^(-1)-[A^(-1)U(I+V^(T)A^(-1)U)^(-1)V^(T)A^(-1)] is a formula that allows a perturbed matrix to be computed for a change to a given ...

A finite sequence of n letters from some alphabet is said to be an n-ary word.

The path of an object through phase space.