Search Results for ""

A set S in a vector space over R is called a convex set if the line segment joining any pair of points of S lies entirely in S.

A row-convex polyomino is a self-avoiding convex polyomino such that the intersection of any horizontal line with the polyomino has at most two connected components. A ...

A subset S subset R^n is said to be pseudo-convex at a point x in S if the associated pseudo-tangent cone P_S(x) to S at x contains S-{x}, i.e., if S-{x} subset P_S(x). Any ...

A subset A of a vector space V is said to be convex if lambdax+(1-lambda)y for all vectors x,y in A, and all scalars lambda in [0,1]. Via induction, this can be seen to be ...

A real-valued function g defined on a convex subset C subset R^n is said to be quasi-convex if for all real alpha in R, the set {x in C:g(x)<alpha} is convex. This is ...

A convex function is a continuous function whose value at the midpoint of every interval in its domain does not exceed the arithmetic mean of its values at the ends of the ...

The diagonal of a polyhedron is any line segment connecting two nonadjacent vertices of the polyhedron. Any polyhedron having no diagonals must have a skeleton which is a ...

The Császár polyhedron is a polyhedron that is topologically equivalent to a torus which was discovered in the late 1940s by Ákos Császár (Gardner 1975). It has 7 polyhedron ...

A point at which three or more polyhedron edges of a polyhedron meet. The concept can also be generalized to a polytope.

The Szilassi polyhedron is a heptahedron that is topologically equivalent to a torus and for which every pair of faces has a polygon edge in common. The Szilassi polyhedron ...