Search Results for ""

A braid with M strands and R components with P positive crossings and N negative crossings satisfies |P-N|<=2U+M-R<=P+N, where U is the unknotting number. While the second ...

A branch point of an analytic function is a point in the complex plane whose complex argument can be mapped from a single point in the domain to multiple points in the range. ...

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

A chain complex is a sequence of maps ...-->^(partial_(i+1))C_i-->^(partial_i)C_(i-1)-->^(partial_(i-1))..., (1) where the spaces C_i may be Abelian groups or modules. The ...

The circumcenter of mass is a concept that can be defined by analogy with one of the the constructions for the geometric centroid for the case of polygons. The geometric ...

A circumhyperbola is a circumconic that is a hyperbola. A rectangular circumhyperbola always passes through the orthocenter H and has center on the nine-point circle ...

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

Let X be a normed space, M and N be algebraically complemented subspaces of X (i.e., M+N=X and M intersection N={0}), pi:X->X/M be the quotient map, phi:M×N->X be the natural ...

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

The homomorphism S which, according to the snake lemma, permits construction of an exact sequence (1) from the above commutative diagram with exact rows. The homomorphism S ...