Search Results for ""

(1) or (2) The solutions are Jacobi polynomials P_n^((alpha,beta))(x) or, in terms of hypergeometric functions, as y(x)=C_1_2F_1(-n,n+1+alpha+beta,1+alpha,1/2(x-1)) ...

The complex second-order ordinary differential equation x^2y^('')+xy^'-(ix^2+nu^2)y=0 (1) (Abramowitz and Stegun 1972, p. 379; Zwillinger 1997, p. 123), whose solutions can ...

The kiss surface is the quintic surface of revolution given by the equation x^2+y^2=(1-z)z^4 (1) that is closely related to the ding-dong surface. It is so named because the ...

Let alpha(x) be a step function with the jump j(x)=(N; x)p^xq^(N-x) (1) at x=0, 1, ..., N, where p>0,q>0, and p+q=1. Then the Krawtchouk polynomial is defined by ...

Given an m×n matrix A and a p×q matrix B, their Kronecker product C=A tensor B, also called their matrix direct product, is an (mp)×(nq) matrix with elements defined by ...

Consider the general system of two first-order ordinary differential equations x^. = f(x,y) (1) y^. = g(x,y). (2) Let x_0 and y_0 denote fixed points with x^.=y^.=0, so ...

A lobster graph, lobster tree, or simply "lobster," is a tree having the property that the removal of leaf nodes leaves a caterpillar graph (Gallian 2007). The numbers of ...

Consider the Lagrange interpolating polynomial f(x)=b_0+(x-1)(b_1+(x-2)(b_3+(x-3)+...)) (1) through the points (n,p_n), where p_n is the nth prime. For the first few points, ...

A general formula giving the number of distinct ways of folding an m×n rectangular map is not known. A distinct folding is defined as a permutation of N=m×n numbered cells ...

The Markström graph is a cubic planar graph on 24 vertices which lacks cycles of length 4 and 8 but contains cycles of length 16. (In particular, it contains cycles of ...