Search Results for ""

A n-dipyramidal graph is the skeleton of an n-sided dipyramid. It is isomorphic to the (m,2)-cone graph C_m+K^__2, where C_m is a cycle graph, K^__2 is the empty graph on 2 ...

A nonzero vector v=(v_0,v_1,...,v_(n-1)) in n-dimensional Lorentzian space R^(1,n-1) is said to be negative lightlike if it has zero (Lorentzian) norm and if its first ...

A nonzero vector v=(v_0,v_1,...,v_(n-1)) in n-dimensional Lorentzian space R^(1,n-1) is said to be positive lightlike if it has zero (Lorentzian) norm and if its first ...

A set in R^d is concave if it does not contain all the line segments connecting any pair of its points. If the set does contain all the line segments, it is called convex.

Each centered convex body of sufficiently high dimension has an "almost spherical" k-dimensional central section.

Any set of n+2 points in R^n can always be partitioned in two subsets V_1 and V_2 such that the convex hulls of V_1 and V_2 intersect.

A barrel solid of revolution composed of parallel circular top and bottom with a common axis and a side formed by a smooth curve symmetrical about the midplane. The term also ...

Alexandrov's theorem addresses conditions under which a polygon will fold into a convex polyhedron (Malkevitch).

A convex set K is centro-symmetric, sometimes also called centrally symmetric, if it has a center p that bisects every chord of K through p.

A pyramid with a heptagonal base. The heptagonal pyramid is one of the 257 convex octahedra.