Search Results for ""

In algebraic topology, a p-skeleton is a simplicial subcomplex of K that is the collection of all simplices of K of dimension at most p, denoted K^((p)). The graph obtained ...

The happy end problem, also called the "happy ending problem," is the problem of determining for n>=3 the smallest number of points g(n) in general position in the plane ...

The rhombic hexecontahedron is a 60-faced polyhedron that can be obtained by stellating the rhombic triacontahedron by placing a plane along each edge which is perpendicular ...

Every convex body B in the Euclidean plane with area A can be inscribed in a triangle of area at most equal to 2A (Gross 1918, Eggleston 1957). The worst possible fit ...

The great stellated dodecahedron is one of the Kepler-Poinsot polyhedra. It is also the uniform polyhedron with Maeder index 52 (Maeder 1997), Wenninger index 22 (Wenninger ...

A hedgehog is an envelope parameterized by its Gauss map (Martinez-Maure 1996). Viewed another way, a hedgehog is a Minkowski difference of a convex body (Martinez-Maure ...

Let the opposite sides of a convex cyclic hexagon be a, a^', b, b^', c, and c^', and let the polygon diagonals e, f, and g be so chosen that a, a^', and e have no common ...

Let E and F be paired spaces with S a family of absolutely convex bounded sets of F such that the sets of S generate F and, if B_1,B_2 in S, there exists a B_3 in S such that ...

If, in a plane or spherical convex polygon ABCDEFG, all of whose sides AB, BC, CD, ..., FG (with the exception of AG) have fixed lengths, one simultaneously increases ...

The truncated dodecadodecahedral graph is the skeleton of the truncated dodecadodecahedron, which is the only uniform polyhedron for which this is the case. It will be ...