Search Results for ""

Polynomials s_k(x;lambda,mu) which are a generalization of the Boole polynomials, form the Sheffer sequence for g(t) = (1+e^(lambdat))^mu (1) f(t) = e^t-1 (2) and have ...

Plancherel's theorem states that the integral of the squared modulus of a function is equal to the integral of the squared modulus of its spectrum. It corresponds to ...

Given an obtuse triangle, the polar circle has center at the orthocenter H. Call H_i the feet. Then the square of the radius r is given by r^2 = HA^_·HH_A^_ (1) = HB^_·HH_B^_ ...

An algorithm is said to be solvable in polynomial time if the number of steps required to complete the algorithm for a given input is O(n^k) for some nonnegative integer k, ...

The projective plane crossing number of a graph is the minimal number of crossings with which the graph can be drawn on the real projective plane. A graph with projective ...

A proof by contradiction establishes the truth of a given proposition by the supposition that it is false and the subsequent drawing of a conclusion that is contradictory to ...

The quadrifolium is the 4-petalled rose curve having n=2. It has polar equation r=asin(2theta) (1) and Cartesian equation (x^2+y^2)^3=4a^2x^2y^2. (2) The area of the ...

A graph G that becomes disconnected when removing a suitable complete subgraph K, called a vertex cut, is said to be quasiseparable. The two simplest cases are those where K ...

If the rank polynomial R(x,y) of a graph G is given by sumrho_(rs)x^ry^s, then rho_(rs) is the number of subgraphs of G with rank r and co-rank s, and the matrix (rho_(rs)) ...

The Rayleigh functions sigma_n(nu) for n=1, 2, ..., are defined as sigma_n(nu)=sum_(k=1)^inftyj_(nu,k)^(-2n), where +/-j_(nu,k) are the zeros of the Bessel function of the ...