Pursuing punctured polyhedra.The flat faces and straight edges of a cube signify that it belongs to a large family of geometric shapes This is a list of geometric shapes. Generally composed of straight line segments
wondered whether a polyhedron polyhedron (pŏl'ēhē`drən), closed solid bounded by plane faces; each face of a polyhedron is a polygon. A cube is a polyhedron bounded by six polygons (in this case squares) meeting at right angles. could have a hole passing through every face and remain a polyhedron. He coined the term holyhedron to describe such a form, should it exist. For a long time, no one could come up with an example, even in principle, that met Conway's precise specifications for a holyhedron. Conversely, no one could say why it was impossible to construct one. Now, Princeton mathematician Jade P. Vinson has proved that such an object can exist. His surprising solution is slated for publication in DISCRETE AND COMPUTATIONAL GEOMETRY (mathematics) computational geometry - The study of algorithms for combinatorial, topological, and metric problems concerning sets of points, typically in Euclidean space. Representative areas of research include geometric search, convexity, proximity, intersection, and linear programming. . One way to approach the problem is to consider what happens when a vertex of one polyhedron pierces the face of another. A tetrahedron tetrahedron: see polyhedron. , for example, has four triangular faces and four vertices The plural of vertex. See vertex. . It's possible to construct an infinite lattice of interpenetrating tetrahedra, where each face of each tetrahedron is pierced by the vertex of another. In effect, each face has a hole where a vertex punctures it. Conway, however, was looking for Looking for In the context of general equities, this describing a buy interest in which a dealer is asked to offer stock, often involving a capital commitment. Antithesis of in touch with. a finite structure rather than an infinite array. To solve the problem, Vinson opted to use polyhedra that have more vertices than faces. "The first key idea ... was to find a simple, repetitive arrangement of polyhedra so that there is a large excess of unused vertices over unpierced faces," he says. "The second key idea was to `trade' several unused vertices in an inconvenient location for a single new vertex in a better location." Vinson's careful manipulations produced a monstrous holyhedron with 78,585,627 faces. "The current construction is hard to visualize," he admits. Simple cardboard models give just the roughest idea of how it all fits together. Conway had offered a reward of $10,000--divided by the number of faces--for finding a holyhedron, so Vinson's initial effort netted him a minuscule return. Conway suspects that someone may yet find a holyhedron with fewer than 100 faces. |
|
||||||||||||||||||||

Printer friendly
Cite/link
Email
Feedback
Reader Opinion