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.

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

A submodule L of a module M such that for any other nonzero submodule K of M, the intersection L intersection K is not the zero module. L is also called an essential ...

The statistical index P_L=(sump_nq_0)/(sump_0q_0), where p_n is the price per unit in period n and q_0 is the quantity produced in the initial period.

A generalization of the concept of set unions and intersections.