Search Results for ""
541 - 550 of 772 for Convex PolygonSearch Results
The Banach-Saks theorem is a result in functional analysis which proves the existence of a "nicely-convergent" subsequence for any sequence {f_n}={f_n}_(n in Z^*) of ...
There are several attractive polyhedron compounds consisting of three cubes. The first (left figures) arises by joining three cubes such that each shares two C_2 axes (Holden ...
There are a number of attractive polyhedron compounds consisting of five octahedra. The first octahedron 5-compound is a polyhedron compound composed of five octahedra ...
The simplex method is a method for solving problems in linear programming. This method, invented by George Dantzig in 1947, tests adjacent vertices of the feasible set (which ...
The mean tetrahedron volume of a tetrahedron with vertices chosen at random inside another tetrahedron of unit volume is given by V^_ = (13)/(720)-(pi^2)/(15015) (1) = ...
The ideal generated by a set in a vector space.
A set X is called a "cone" with vertex at the origin if for any x in X and any scalar a>=0, ax in X.
An n×n square matrix M with M_(ii) = 1 (1) M_(ij) = M_(ji)>1 (2) for all i,j=1, ..., n.
A chord which is a normal at each end. A centrosymmetric set K subset R^d has d double normals through the center (Croft et al. 1991). For a curve of constant width, all ...
The simplest algebraic language, denoted D. If X is the alphabet {x,x^_}, then D is the set of words u of X which satisfy 1. |u|_x=|u|_(x^_), where |u|_x is the numbers of ...
...
View search results from all Wolfram sites (4549 matches)

