Uniform partitions of 3-space, their relatives and embedding

From MaRDI portal
Publication:1582487



Abstract: We review 28 uniform partitions of 3-space in order to find out which of them have graphs (skeletons) embeddable isometrically (or with scale 2) into some cubic lattice . We also consider some relatives of those 28 partitions, including Achimedean 4-polytopes of Conway-Guy, non-compact uniform partitions, Kelvin partitions and those with unique vertex figure (i.e. Delaunay star). Among last ones we indicate two continuums of aperiodic tilings by semi-regular 3-prisms with cubes or with regular tetrahedra and regular octahedra. On the way many new partitions are added to incomplete cases considered here.


A convex \(3\)-polytope is called uniform if its facets are regular polygons and its group of (affine) automorphisms acts transitively on the set of vertices. A uniform partition of the Euclidean \(3\)-space is a (necessarily infinite) polytopal decomposition into uniform polytopes with a vertex transitive automorphism group. \textit{B. Grünbaum} [Geombinatorics 4, No. 2, 49-56 (1994; Zbl 0844.52022)] classified the 28~types. The paper under review contains tables on the combinatorics of these and related partitions. The main focus is on the embeddability of the graphs of the partitions.











This page was built for publication: Uniform partitions of 3-space, their relatives and embedding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1582487)