Search Results for ""

The inverse of the Laplace transform, given by F(t)=1/(2pii)int_(gamma-iinfty)^(gamma+iinfty)e^(st)f(s)ds, where gamma is a vertical contour in the complex plane chosen so ...

The Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.

A section of a fiber bundle gives an element of the fiber over every point in B. Usually it is described as a map s:B->E such that pi degreess is the identity on B. A ...

The 6-polyiamond illustrated above.

A function f is Carathéodory differentiable at a if there exists a function phi which is continuous at a such that f(x)-f(a)=phi(x)(x-a). Every function which is Carathéodory ...

Each point in the convex hull of a set S in R^n is in the convex combination of n+1 or fewer points of S.

Let A be a unital Banach algebra. If a in A and ||1-a||<1, then a^(-1) can be represented by the series sum_(n=0)^(infty)(1-a)^n. This criterion for checking invertibility of ...

A Cartesian curve is a curve specified in Cartesian coordinates. The term "Cartesian curve" is sometimes also used to refer to the Cartesian ovals.

The use of coordinates (such as Cartesian coordinates) in the study of geometry. Cartesian geometry is named after René Descartes (Bell 1986, p. 48), although Descartes may ...

The conjecture proposed by Catalan in 1888 and extended by E. Dickson that each aliquot sequence ends in a prime, a perfect number, or a set of sociable numbers. The ...