Search Results for ""

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

For every positive integer n, there exists a square in the plane with exactly n lattice points in its interior. This was extended by Schinzel and Kulikowski to all plane ...

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.

Any n-dimensional Riemannian manifold can be locally embedded into an (n+1)-dimensional manifold with Ricci curvature Tensor R_(ab)=0. A similar version of the theorem for a ...

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 ...