Search Results for ""

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

Divide the sides of a quadrilateral into three equal parts. The figure formed by connecting and extending adjacent points on either side of a polygon vertex is a ...

A Woo circle is an Archimedean circle with center on the Schoch line and tangent to certain other circles. An applet for investigating Woo circles and Schoch lines has been ...

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.

One of the seven 4-polyhexes. S. Kim has observed that four worms solve the puzzle of finding a non-three-colorable map with only four congruent countries (as long as no ...

The Wormald graph is a unit-distance 4-chromatic graph with girth 5 on 13+5(13; 5)=6448 vertices.

The entire function phi(rho,beta;z)=sum_(k=0)^infty(z^k)/(k!Gamma(rhok+beta)), where rho>-1 and beta in C, named after the British mathematician E. M. Wright.