Search Results for ""

Special functions which arise as solutions to second order ordinary differential equations are commonly said to be "of the first kind" if they are nonsingular at the origin, ...

The n×n square matrix F_n with entries given by F_(jk)=e^(2piijk/n)=omega^(jk) (1) for j,k=0, 1, 2, ..., n-1, where i is the imaginary number i=sqrt(-1), and normalized by ...

A graph G is fully reconstructible in C^d if the graph is determined from its d-dimensional measurement variety. If G is globally rigid in R^d on n>=d+2 vertices, then G is ...

Let the multiples m, 2m, ..., [(p-1)/2]m of an integer such that pm be taken. If there are an even number r of least positive residues mod p of these numbers >p/2, then m is ...

A ruled surface is called a generalized cylinder if it can be parameterized by x(u,v)=vp+y(u), where p is a fixed point. A generalized cylinder is a regular surface wherever ...

A number given by the generating function (2t)/(e^t+1)=sum_(n=1)^inftyG_n(t^n)/(n!). (1) It satisfies G_1=1, G_3=G_5=G_7=...=0, and even coefficients are given by G_(2n) = ...

The golden angle is the angle that divides a full angle in a golden ratio (but measured in the opposite direction so that it measures less than 180 degrees), i.e., GA = ...

Nice approximations for the golden ratio phi are given by phi approx sqrt((5pi)/6) (1) approx (7pi)/(5e), (2) the last of which is due to W. van Doorn (pers. comm., Jul. 18, ...

The square of a graph is defined as its second graph power. The square of any biconnected graph is Hamiltonian (Fleischner 1974, Skiena 1990, p. 231). Mukhopadhyay (1967) has ...

The grid shading problem is the problem of proving the unimodality of the sequence {a_1,a_2,...,a_(mn)}, where for fixed m and n, a_i is the number of partitions of i with at ...