Search Results for ""
851 - 860 of 3197 for chess mathSearch Results

The point of concurrence S of a triangle's cleavers M_1C_1, M_2C_2, and M_3C_3, which is simply the Spieker center, i.e., the incenter of the medial triangle DeltaM_1M_2M_3 ...
Let p be a non-wandering point of a diffeomorphism S:M->M of a compact manifold. The closing lemma concerns if S can be arbitrarily well approximated with derivatives of ...
The collapsoids are a class of non-convex collapsible polyhedra. They can be constructed by replacing each edge of a dodecahedron or icosahedron by the diagonal of a pyramid ...
Inside a ball B in R^3, {rectifiable currents S in BL area S<=c, length partialS<=c} is compact under the flat norm.
A concho-spiral, also known as a conchospiral, is a space curve with parametric equations r = mu^ua (1) theta = u (2) z = mu^uc, (3) where mu, a, and c are fixed parameters. ...
Two or more lines which intersect in a point are said to concur.
A topological structure which interpolates between contact structures and codimension-one foliations.
A proposition which is consistent with known data, but has neither been verified nor shown to be false. It is synonymous with hypothesis.
The problem of maximizing a linear function over a convex polyhedron, also known as operations research or optimization theory. The general problem of convex optimization is ...
A convex polyomino (sometimes called a "convex polygon") is a polyomino whose perimeter is equal to that of its minimal bounding box (Bousquet-Mélou et al. 1999). ...

...