Search Results for ""

The wreath graph W(n,k) is the graph obtained by taking n collections of k nodes and arranging around a circle such that all nodes in adjacent collections are connected. ...

The conjecture made by Belgian mathematician Eugène Charles Catalan in 1844 that 8 and 9 (2^3 and 3^2) are the only consecutive powers (excluding 0 and 1). In other words, ...

French curves are plastic (or wooden) templates having an edge composed of several different curves. French curves are used in drafting (or were before computer-aided design) ...

A set in Euclidean space R^d is convex set if it contains all the line segments connecting any pair of its points. If the set does not contain all the line segments, it is ...

The invariants of a Weierstrass elliptic function P(z|omega_1,omega_2) are defined by the Eisenstein series g_2(omega_1,omega_2) = 60sum^'_(m,n)Omega_(mn)^(-4) (1) ...

A theorem in the theory of univalent conformal mappings of families of domains on a Riemann surface, containing an inequality for the coefficients of the mapping functions, ...

A *-algebra A of operators on a Hilbert space H is said to act nondegenerately if whenever Txi=0 for all T in A, it necessarily implies that xi=0. Algebras A which act ...

The Poisson sum formula is a special case of the general result sum_(-infty)^inftyf(x+n)=sum_(k=-infty)^inftye^(2piikx)int_(-infty)^inftyf(x^')e^(-2piikx^')dx^' (1) with x=0, ...

In the tabu search category of meta-heuristics, the essential idea is to 'forbid' search moves to points already visited in the (usually discrete) search space, at least for ...

An upper triangular matrix U is defined by U_(ij)={a_(ij) for i<=j; 0 for i>j. (1) Written explicitly, U=[a_(11) a_(12) ... a_(1n); 0 a_(22) ... a_(2n); | | ... |; 0 0 ... ...