Search Results for ""

A Kähler structure on a complex manifold M combines a Riemannian metric on the underlying real manifold with the complex structure. Such a structure brings together geometry ...

The Klein bottle crossing number of a graph G is the minimum number of crossings possible when embedding G on a Klein bottle (cf. Garnder 1986, pp. 137-138). While the ...

The Laplacian matrix, sometimes also called the admittance matrix (Cvetković et al. 1998, Babić et al. 2002) or Kirchhoff matrix, of a graph G, where G=(V,E) is an ...

The process of finding a reduced set of basis vectors for a given lattice having certain special properties. Lattice reduction algorithms are used in a number of modern ...

Also known as the alternating series test. Given a series sum_(n=1)^infty(-1)^(n+1)a_n with a_n>0, if a_n is monotonic decreasing as n->infty and lim_(n->infty)a_n=0, then ...

A function f which may (but does not necessarily) associate a given member of the range of f with more than one member of the domain of f. For example, trigonometric ...

An algorithm which constructs allowed mathematical statements from simple ingredients.

Roughly speaking, a matroid is a finite set together with a generalization of a concept from linear algebra that satisfies a natural set of properties for that concept. For ...

The McLaughlin graph is a 112-regular graph on 275 nodes and 15400 edges that can be constructed from the Witt design. It is distance-regular with intersection array ...

A set considered together with the sigma-algebra on the set.