Search Results for ""

Branch and bound algorithms are a variety of adaptive partition strategies have been proposed to solve global optimization models. These are based upon partition, sampling, ...

A polyhedron is said to be canonical if all its polyhedron edges touch a sphere and the center of gravity of their contact points is the center of that sphere. In other ...

Let J be a finite group and the image R(J) be a representation which is a homomorphism of J into a permutation group S(X), where S(X) is the group of all permutations of a ...

A problem sometimes known as Moser's circle problem asks to determine the number of pieces into which a circle is divided if n points on its circumference are joined by ...

The complementary Bell numbers, also called the Uppuluri-Carpenter numbers, B^~_n=sum_(k=0)^n(-1)^kS(n,k) (1) where S(n,k) is a Stirling number of the second kind, are ...

Form a sequence from an alphabet of letters [1,n] such that there are no consecutive letters and no alternating subsequences of length greater than d. Then the sequence is a ...

Direct sums are defined for a number of different sorts of mathematical objects, including subspaces, matrices, modules, and groups. The matrix direct sum is defined by ...

The term "Euler graph" is sometimes used to denote a graph for which all vertices are of even degree (e.g., Seshu and Reed 1961). Note that this definition is different from ...

A free idempotent monoid is a monoid that satisfies the identity x^2=x and is generated by a set of elements. If the generating set of such a monoid is finite, then so is the ...

A generalized Moore graph is a regular graph of degree r where the counts of vertices at each distance d=0, 1, ... from any vertex are 1, r, r(r-1), r(r-1)^2, r(r-1)^3, ..., ...