Search Results for ""

A connected graph G is distance-regular if for any vertices x and y of G and any integers i,j=0, 1, ...d (where d is the graph diameter), the number of vertices at distance i ...

An n×n matrix whose rows are composed of cyclically shifted versions of a length-n list l. For example, the 4×4 circulant matrix on the list l={1,2,3,4} is given by C=[4 1 2 ...

According to Pólya, the Cartesian pattern is the resolution method for arithmetical or geometrical problems based on equations. The first step is to translate the question ...

The angle obtained by drawing the auxiliary circle of an ellipse with center O and focus F, and drawing a line perpendicular to the semimajor axis and intersecting it at A. ...

An integrating factor is a function by which an ordinary differential equation can be multiplied in order to make it integrable. For example, a linear first-order ordinary ...

A procedure for determining the behavior of an nth order ordinary differential equation at a removable singularity without actually solving the equation. Consider ...

Curves with Cartesian equation ay^2=x(x^2-2bx+c) with a>0. The above equation represents the third class of Newton's classification of cubic curves, which Newton divided into ...

A system of curvilinear coordinates. There are several different conventions for the orientation and designation of these coordinates. Arfken (1970) defines coordinates ...

The solutions to the Riemann P-differential equation are known as the Riemann P-series, or sometimes the Riemann P-function, given by u(z)=P{a b c; alpha beta gamma; alpha^' ...

A system of curvilinear coordinates for which several different notations are commonly used. In this work (u,v,phi) is used, whereas Arfken (1970) uses (xi,eta,phi) and Moon ...