Related papers: Three, four and five-dimensional fullerenes
Let $\mathcal{P}$ be the class of combinatorial 3-dimensional simple polytopes $P$, different from a tetrahedron, without 3- and 4-belts of facets. By the results of Pogorelov and Andreev, a polytope $P$ admits a realisation in Lobachevsky…
A chiral polyhedron has a geometric symmetry group with two orbits on the flags, such that adjacent flags are in distinct orbits. Part I of the paper described the discrete chiral polyhedra in ordinary Euclidean 3-space with finite skew…
A fullerene, or buckyball, is a trivalent graph on the sphere with only pentagonal and hexagonal faces. Building on ideas of Thurston, we use modular forms to give an exact formula for the number of oriented fullerenes with a given number…
The Skyrme model is a classical field theory which has topological soliton solutions. These solitons are candidates for describing nuclei, with an identification between the numbers of solitons and nucleons. We have computed numerically,…
A polytope is called {\em regular-faced} if every one of its facets is a regular polytope. The 4-dimensional regular-faced polytopes were determined by G. Blind and R. Blind \cite{BlBl2,roswitha,roswitha2}. The last class of such polytopes…
Start with Gott (2019)'s envelope polyhedron (Squares-4 around a point): a unit cube missing its top and bottom faces. Stretch by a factor of 2 in the vertical direction so its sides become (2x1 unit) rectangles. This has 8 faces (4…
Skeletal polyhedra are discrete structures made up of finite, flat or skew, or infinite, helical or zigzag, polygons as faces, with two faces on each edge and a circular vertex-figure at each vertex. When a variant of Wythoff's construction…
A group-theoretical approach to the construction of quasiperiodic tilings of a Euclidean plane, possessing five-fold symmetry, is applied. Of the infinitely many of variants of quasiperiodic partitions of the plane, possessing the dihedral…
We describe a family of 4-dimensional hyperbolic orbifolds, constructed by deforming an infinite volume orbifold obtained from the ideal, hyperbolic 24-cell by removing two walls. This family provides an infinite number of infinitesimally…
The regular polyhedra have the highest order of 3D symmetries and are exceptionally at- tractive templates for (self)-assembly using minimal types of building blocks, from nano-cages and virus capsids to large scale constructions like glass…
The problem of constructing a limit series of Penrose type partitions of a two-dimensional sphere is solved, which makes it possible to model quasicrystals possessing a point icosahedral group symmetry Ih. Images of polyhedron models are…
A natural extension of Heron's 2000 year old formula for the area of a triangle to the volume of a tetrahedron is presented. This gives the fourth power of the volume as a polynomial in six simple rational functions of the areas of its four…
We study the extension complexity of polytopes with few vertices or facets. On the one hand, we provide a complete classification of $d$-polytopes with at most $d+4$ vertices according to their extension complexity: Out of the…
This presentation starts with the regular polygons, of course, then with the Platonic and Archimedean solids. The latter ones are whose symmetry groups are transitive on the vertices, and in addition, whose faces are regular polygons (see…
Which convex 3D polyhedra can be obtained by gluing several regular hexagons edge-to-edge? It turns out that there are only 15 possible types of shapes, 5 of which are doubly-covered 2D polygons. We give examples for most of them, including…
Regular polygonal complexes in euclidean 3-space are discrete polyhedra-like structures with finite or infinite polygons as faces and with finite graphs as vertex-figures, such that their symmetry groups are transitive on the flags. The…
We introduce the fatness parameter of a 4-dimensional polytope P, defined as \phi(P)=(f_1+f_2)/(f_0+f_3). It arises in an important open problem in 4-dimensional combinatorial geometry: Is the fatness of convex 4-polytopes bounded? We…
We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration…
Regular polytopes, the generalization of the five Platonic solids in 3 space dimensions, exist in arbitrary dimension $n\geq-1$; now in {\rm dim}. 2, 3 and 4 there are \emph{extra} polytopes, while in general dimensions only the…
The Wythoff construction takes a $d$-dimensional polytope $P$, a subset $S$ of $\{0,..., d\}$ and returns another $d$-dimensional polytope $P(S)$. If $P$ is a regular polytope, then $P(S)$ is vertex-transitive. This construction builds a…