Search Results for ""

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

A normed vector space X=(X,||·||_X) is said to be uniformly convex if for sequences {x_n}={x_n}_(n=1)^infty, {y_n}={y_n}_(n=1)^infty, the assumptions ||x_n||_X<=1, ...

A function f(x) is completely convex in an open interval (a,b) if it has derivatives of all orders there and if (-1)^kf^((2k))(x)>=0 for k=0, 1, 2, ... in that interval ...

The convex hull of two or more functions is the largest function that is concave from above and does not exceed the given functions.

A convex polyomino containing at least one edge of its minimal bounding rectangle. The perimeter and area generating function for directed polygons of width m, height n, and ...

A bounded plane convex region symmetric about a lattice point and with area >4 must contain at least three lattice points in the interior. In n dimensions, the theorem can be ...

The space join of a topological space X and a point P, C(X)=X*P.

In homogeneous coordinates, the first positive quadrant joins (0,1) with (1,0) by "points" (f_1,f_2), and is mapped onto the hyperbolic line -infty<u<+infty by the ...

The inner and outer spheres tangent internally to a cone and also to a plane intersecting the cone are called Dandelin spheres. The spheres can be used to show that the ...

One of the two pieces of a double cone (i.e., two cones placed apex to apex).