Uniform partitions of 3-space, their relatives and embedding
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.
- The three space problem for smooth partitions of unity and \(C(K)\) spaces
- scientific article; zbMATH DE number 939759
- Partitioning 3-uniform hypergraphs
- Partitions of unity and coverings
- Constructions for uniform \((m,3)\)-splitting systems
- On partitioning the triples of a topological space
- Judicious partitions of 3-uniform hypergraphs
- Partitions of $R^3$ into curves
- scientific article; zbMATH DE number 866040
- scientific article; zbMATH DE number 1066168
- Clin d'oeil on L₁-embeddable planar graphs
- Geometry of cuts and metrics
- scientific article; zbMATH DE number 4191699 (Why is no real title available?)
- scientific article; zbMATH DE number 866040 (Why is no real title available?)
- scientific article; zbMATH DE number 3241001 (Why is no real title available?)
- Isometric embeddings of semiregular polyhedra, tilings and their duals in hypercubes and cubic lattices
- On scale embeddings of graphs into hypercubes
- The embedding of graphs in hypercubes and cubic lattices
- Wythoff's Construction for Uniform Polytopes
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)