HOME

TheInfoList



OR:

In
geometry Geometry (; ) is a branch of mathematics concerned with properties of space such as the distance, shape, size, and relative position of figures. Geometry is, along with arithmetic, one of the oldest branches of mathematics. A mathematician w ...
, the Császár polyhedron () is a nonconvex
toroidal polyhedron In geometry, a toroidal polyhedron is a polyhedron which is also a toroid (a -holed torus), having a topology (Mathematics), topological Genus (mathematics), genus () of 1 or greater. Notable examples include the Császár polyhedron, Császár a ...
with 14 triangular faces. This polyhedron has no
diagonal In geometry, a diagonal is a line segment joining two vertices of a polygon or polyhedron, when those vertices are not on the same edge. Informally, any sloping line is called diagonal. The word ''diagonal'' derives from the ancient Greek � ...
s; every pair of vertices is connected by an edge. The seven vertices and 21 edges of the Császár polyhedron form an embedding of the
complete graph In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge. A complete digraph is a directed graph in which every pair of distinct vertices i ...
onto a topological
torus In geometry, a torus (: tori or toruses) is a surface of revolution generated by revolving a circle in three-dimensional space one full revolution about an axis that is coplanarity, coplanar with the circle. The main types of toruses inclu ...
. Of the 35 possible triangles from vertices of the polyhedron, only 14 are faces.


Complete graph

The
tetrahedron In geometry, a tetrahedron (: tetrahedra or tetrahedrons), also known as a triangular pyramid, is a polyhedron composed of four triangular Face (geometry), faces, six straight Edge (geometry), edges, and four vertex (geometry), vertices. The tet ...
and the Császár polyhedron are the only two known polyhedra (having a
manifold In mathematics, a manifold is a topological space that locally resembles Euclidean space near each point. More precisely, an n-dimensional manifold, or ''n-manifold'' for short, is a topological space with the property that each point has a N ...
boundary) without any diagonals: every two vertices of the polygon are connected by an edge, so there is no line segment between two vertices that does not lie on the polyhedron boundary. That is, the vertices and edges of the Császár polyhedron form a
complete graph In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge. A complete digraph is a directed graph in which every pair of distinct vertices i ...
. The combinatorial description of this polyhedron has been described earlier by Möbius. Three additional different polyhedra of this type can be found in a paper by . If the boundary of a polyhedron with ''v'' vertices forms a surface with ''h'' holes, in such a way that every pair of vertices is connected by an edge, it follows by some manipulation of the
Euler characteristic In mathematics, and more specifically in algebraic topology and polyhedral combinatorics, the Euler characteristic (or Euler number, or Euler–Poincaré characteristic) is a topological invariant, a number that describes a topological space's ...
that h = \frac. This equation is satisfied for the tetrahedron with ''h'' = 0 and ''v'' = 4, and for the Császár polyhedron with ''h'' = 1 and ''v'' = 7. The next possible solution, ''h'' = 6 and ''v'' = 12, would correspond to a polyhedron with 44 faces and 66 edges, but it is not realizable as a polyhedron. It is not known whether such a polyhedron exists with a higher genus. More generally, this equation can be satisfied only when ''v'' is congruent to 0, 3, 4, or 7
modulo In computing and mathematics, the modulo operation returns the remainder or signed remainder of a division, after one number is divided by another, the latter being called the '' modulus'' of the operation. Given two positive numbers and , mo ...
12.


History and related polyhedra

The Császár polyhedron is named after Hungarian topologist Ákos Császár, who discovered it in 1949. The dual to the Császár polyhedron, the Szilassi polyhedron, was discovered later, in 1977, by Lajos Szilassi; it has 14 vertices, 21 edges, and seven
hexagon In geometry, a hexagon (from Greek , , meaning "six", and , , meaning "corner, angle") is a six-sided polygon. The total of the internal angles of any simple (non-self-intersecting) hexagon is 720°. Regular hexagon A regular hexagon is de ...
al faces, each sharing an edge with every other face. Like the Császár polyhedron, the Szilassi polyhedron has the topology of a torus. There are other known polyhedra such as the Schönhardt polyhedron for which there are no interior diagonals (that is, all diagonals are outside the polyhedron) as well as non-manifold surfaces with no diagonals.


References


External links

*
Császár’s polyhedron
in virtual reality in NeoTrie VR. {{DEFAULTSORT:Csaszar Polyhedron Nonconvex polyhedra Toroidal polyhedra Articles containing video clips