Search Results for ""

The recurrence relation (n-1)A_(n+1)=(n^2-1)A_n+(n+1)A_(n-1)+4(-1)^n valid for n=4, 5, ... with A(2)=0 and A(3)=1 and which solves the married couples problem (Dörrie 1965, ...

Let a graph G have exactly 2n-3 graph edges, where n is the number of graph vertices in G. Then G is "generically" rigid in R^2 iff e^'<=2n^'-3 for every subgraph of G having ...

The Lambert cylindrical equal-area projection is a cylindrical equal-area projection with standard parallel phi_s=0 degrees.

As Gauss showed in 1812, the hyperbolic tangent can be written using a continued fraction as tanhx=x/(1+(x^2)/(3+(x^2)/(5+...))) (Wall 1948, p. 349; Olds 1963, p. 138).

A root-finding algorithm also called Bailey's method and Hutton's method. For a function of the form g(x)=x^d-r, Lambert's method gives an iteration function ...

There are two curves commonly known as the Lamé curve: the ellipse evolute and the superellipse.

A two-dimensional planar closed surface L which has a mass M and a surface density sigma(x,y) (in units of mass per areas squared) such that M=int_Lsigma(x,y)dxdy. The center ...

A lattice which is built up of layers of n-dimensional lattices in (n+1)-dimensional space. The vectors specifying how layers are stacked are called glue vectors. The order ...

An algorithm for computing the eigenvalues and eigenvectors for large symmetric sparse matrices.

The conjecture that the Artin L-function of any n-dimensional complex representation of the Galois group of a finite extension of the rational numbers Q is an Artin ...