English
Related papers

Related papers: Chiral polyhedra in ordinary space, II

200 papers

In this paper we finish the intensive study of three-dimensional Dirichlet stereohedra started by the second author and D. Bochis, who showed that they cannot have more than 80 facets, except perhaps for crystallographic space groups in the…

Combinatorics · Mathematics 2011-09-20 Pilar Sabariego , Francisco Santos

A cubic polyhedron is a polyhedral surface whose edges are exactly all the edges of the cubic lattice. Every such polyhedron is a discrete minimal surface, and it appears that many (but not all) of them can be relaxed to smooth minimal…

Metric Geometry · Mathematics 2007-05-23 Chaim Goodman-Strauss , John M Sullivan

We prove that Dirichlet stereohedra for non-cubic crystallographic groups in dimension 3 cannot have more than 80 facets. The bound depends on the particular crystallographic group considered and is above 50 only on 9 of the 97 affine…

Combinatorics · Mathematics 2007-05-23 Daciana Bochis , Francisco Santos

We show the existence of families of periodic polyhedra in spaces of constant curvature whose fundamental domains can be obtained by attaching prisms and antiprisms to Archimedean solids. These polyhedra have constant discrete curvature and…

Differential Geometry · Mathematics 2024-01-09 Christina Duffield , Daniel Freese , William Holt , Matthias Weber , Ramazan Yol

In this paper, we give an example of a chiral 4-polytope in projective 3-space. This example naturally yields a finite chiral 4-polytope in Euclidean 4-space, giving a counterexample to Theorem 11.2 of [2].

Combinatorics · Mathematics 2013-11-08 Javier Bracho , Isabel Hubard , Daniel Pellicer

An abstract polytope of rank n is said to be chiral if its automorphism group has two orbits on the flags, such that adjacent flags belong to distinct orbits. Examples of chiral polytopes have been difficult to find. A "mixing" construction…

Combinatorics · Mathematics 2012-01-17 Gabe Cunningham

The shape of crystalline nanoparticles (NP) can often be described by polyhedra with flat facet surfaces. Thus, structural studies of polyhedral bodies can help to describe geometric details of NPs. Here we consider compact polyhedra of…

Mesoscale and Nanoscale Physics · Physics 2023-07-24 Klaus E. Hermann

There are two main thrusts in the theory of regular and chiral polytopes: the abstract, purely combinatorial aspect, and the geometric one of realizations. This brief survey concentrates on the latter. The dimension of a faithful…

Metric Geometry · Mathematics 2007-05-23 Peter McMullen , Egon Schulte

Answering a question posed by Joseph Malkevitch, we prove that there exists a polyhedral graph, with triangular faces, such that every realization of it as the graph of a convex polyhedron includes at least one face that is a scalene…

Computational Geometry · Computer Science 2021-07-02 David Eppstein

An abstract polytope is \emph{flat} if every facet is incident on every vertex. In this paper, we prove that no chiral polytope has flat finite regular facets and finite regular vertex-figures. We then determine the three smallest non-flat…

Combinatorics · Mathematics 2017-06-06 Gabe Cunningham

A chiral polyhedron with Schl\"afli symbol $\{p, q\}$ is called tight if it has $2pq$ flags, which is the minimum possible. In this paper, we fully characterize the Schl\"afli symbols of tight chiral polyhedra. We also provide presentations…

Combinatorics · Mathematics 2016-03-03 Gabe Cunningham

An abstract polytope is chiral if its automorphism group has two orbits on the flags, such that adjacent flags belong to distinct orbits. There are still few examples of chiral polytopes, and few constructions that can create chiral…

Combinatorics · Mathematics 2012-09-24 Gabe Cunningham

This note introduces the class of basic $r$-ball polyhedra in the $d$-dimensional Euclidean space $\mathbb{E}^{d}$ for $d>1$ and $r>0$. We investigate their face structure and, for given integers $0\leq i\leq d-1$, $n\geq d+1\geq 3$…

Metric Geometry · Mathematics 2026-02-18 Károly Bezdek

An abstract polytope of rank n is said to be chiral if its automorphism group has precisely two orbits on the flags, such that adjacent flags belong to distinct orbits. The present paper describes a general method for deriving new finite…

Combinatorics · Mathematics 2010-08-09 Antonio Breda D'Azevedo , Gareth A. Jones , Egon Schulte

The present work investigates regular, semiregular, and chiral polytopes of any rank $d\geq 3$, whose automorphism groups are 2-groups. There is a large variety of rather small finite regular or alternating semiregular polytopes with…

Group Theory · Mathematics 2025-12-18 Gabriel Cunningham , Yan-Quan Feng , Dong-Dong Hou , Egon Schulte

We classify the dihedral edge-to-edge tilings of the sphere by regular polygons and quadrilaterals with equal opposite edges (edge configuration xyxy).

Combinatorics · Mathematics 2024-03-12 Hoi Ping Luk

Abstract polytopes generalize the face lattice of convex polytopes. A polytope is semiregular if its facets are regular and its automorphism group acts transitively on its vertices. In this paper we construct semiregular, facet-transitive…

Combinatorics · Mathematics 2025-12-17 Elías Mochán

We construct compact polyhedra with $m$-gonal faces whose links are generalized 3-gons. It gives examples of cocompact hyperbolic bildings of type $P(m,3)$. For $m=3$ we get compact spaces covered by Euclidean buildings of type $A_2$.

Combinatorics · Mathematics 2007-05-23 Alina Vdovina

We present new examples of topologically convex edge-ununfoldable polyhedra, i.e., polyhedra that are combinatorially equivalent to convex polyhedra, yet cannot be cut along their edges and unfolded into one planar piece without overlap.…

Computational Geometry · Computer Science 2020-07-30 Erik D. Demaine , Martin L. Demaine , David Eppstein

This paper deals with triangulations of the 2-torus with the vertex labeled general octahedral graph $O_4$ which is isomorphic to the complete four-partite graph $K_{2,2,2,2}$; it is known that there exist precisely twelve such…

Combinatorics · Mathematics 2022-04-25 Serge Lawrencenko , Alex Lao