Search Results for ""

A clique covering of a graph G is set of cliques such that every vertex of G is a member of at least one clique. A minimum clique covering is a clique covering of minimum ...

A coaxal system is a system of coaxal circles. A spectacular example is the set of circles (circumcircle, nine-point circle, orthocentroidal circle, orthoptic circle of the ...

The study of efficient algorithms for solving geometric problems. Examples of problems treated by computational geometry include determination of the convex hull and Voronoi ...

Let mu be a positive measure on a sigma-algebra M, and let lambda be an arbitrary (real or complex) measure on M. If there is a set A in M such that lambda(E)=lambda(A ...

A continuous map is a continuous function between two topological spaces. In some fields of mathematics, the term "function" is reserved for functions which are into the real ...

A set of n variables which fix a geometric object. If the coordinates are distances measured along perpendicular axes, they are known as Cartesian coordinates. The study of ...

The transitive reflexive reduction of a partial order. An element z of a partially ordered set (X,<=) covers another element x provided that there exists no third element y ...

A bounded linear operator T in B(H) on a Hilbert space H is said to be cyclic if there exists some vector v in H for which the set of orbits ...

A vector v on a Hilbert space H is said to be cyclic if there exists some bounded linear operator T on H so that the set of orbits {T^iv}_(i=0)^infty={v,Tv,T^2v,...} is dense ...

A set partition of the rational numbers into two nonempty subsets S_1 and S_2 such that all members of S_1 are less than those of S_2 and such that S_1 has no greatest ...