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.

The zonal polynomials are a class of orthogonal polynomials. They are a special case of the Jack polynomials corresponding to the case alpha=2.

The Janko groups are the four sporadic groups J_1, J_2, J_3 and J_4. The Janko group J_2 is also known as the Hall-Janko group. The Janko groups are implemented in the ...

The smallest number of times u(K) a knot K must be passed through itself to untie it. Lower bounds can be computed using relatively straightforward techniques, but it is in ...

The Abel equation of the first kind is given by y^'=f_0(x)+f_1(x)y+f_2(x)y^2+f_3(x)y^3+... (Murphy 1960, p. 23; Zwillinger 1997, p. 120), and the Abel equation of the second ...

An acnode, also called an isolated point or hermit point, of a curve is a point that satisfies the equation of the curve but has no neighboring points that also lie on the ...

An ordinary differential equation of the form x^my^'=f(x,y), where m is a positive integer, f is analytic at x=y=0, f(0,0)=0, and f_y^'(0,0)!=0. Zwillinger (1997, p. 120), ...

A figurate number of the form, CCub_n=n^3+(n-1)^3=(2n-1)(n^2-n+1). The first few are 1, 9, 35, 91, 189, 341, ... (OEIS A005898). The generating function for the centered cube ...

Let z=x+iy and f(z)=u(x,y)+iv(x,y) on some region G containing the point z_0. If f(z) satisfies the Cauchy-Riemann equations and has continuous first partial derivatives in ...

The central binomial coefficient (2n; n) is never squarefree for n>4. This was proved true for all sufficiently large n by Sárkőzy's theorem. Goetgheluck (1988) proved the ...