相关论文: Three, four and five-dimensional fullerenes

It is well known that a three dimensional (closed, connected and compact) manifold is obtained by identifying boundary faces from a polyhedron P. The study of (\partial P)/~, the boundary \partial P with the polygonal faces identified in…

Given a chiral d-polytope K with regular facets, we describe a construction for a chiral (d + 1)-polytope P with facets isomorphic to K. Furthermore, P is finite whenever K is finite. We provide explicit examples of chiral 4-polytopes…

In this paper, we show how regular convex 4-polytopes - the analogues of the Platonic solids in four dimensions - can be constructed from three-dimensional considerations concerning the Platonic solids alone. Via the Cartan-Dieudonne…

We study $\alpha$-cluster structure based on the geometric configurations with a microscopic framework, which takes full account of the Pauli principle, and which also employs an effective inter-nucleon force including finite-range…

We present a construction in Matrix theory of longitudinal 5-branes whose geometry in transverse space corresponds to a 4-sphere. We describe these branes through an explicit construction in terms of N*N matrices for a particular infinite…

This paper investigates several distinct attempts to generalize in higher dimension the standard 2-dimensional phyllotaxy set construction. We first recall known contructions for these sets on $2D$ manifolds of constant curvature (the…

Skeletal polyhedra are discrete connected structures consisting of finite (planar or skew) or infinite (linear, planar, or spatial) polygons as faces, with two faces on each edge and a circular vertex figure at each vertex. The present…

Cyclohedra are a well-known infinite familiy of finite-dimensional polytopes that can be constructed from centrally symmetric triangulations of even-sided polygons. In this article we introduce an infinite-dimensional analogue and prove…

We complete the classification of compact hyperbolic Coxeter $d$-polytopes with $d+4$ facets for $d=4$ and $5$. By previous work of Felikson and Tumarkin, the only remaining dimension where new polytopes may arise is $d=6$. We derive a new…

These lecture notes treat some current aspects of two closely interrelated topics from the theory of convex polytopes: the shapes of f-vectors, and extremal constructions. The first lecture treats 3-dimensional polytopes; it includes a…

This paper considers Platonic solids/polytopes in the real Euclidean space R^n of dimension 3 <= n < infinity. The Platonic solids/polytopes are described together with their faces of dimensions 0 <= d <= n-1. Dual pairs of Platonic…

We describe a new construction algorithm for the recursive generation of all non-isomorphic IPR fullerenes. Unlike previous algorithms, the new algorithm stays entirely within the class of IPR fullerenes, that is: every IPR fullerene is…

A fullerene graph $F$ is a planar cubic graph with exactly 12 pentagonal faces and other hexagonal faces. A set $\mathcal{H}$ of disjoint hexagons of $F$ is called a resonant pattern (or sextet pattern) if $F$ has a perfect matching $M$…

In this paper, we obtain a complete classification of 331 finite-volume hyperbolic Coxeter 4-dimensional polytopes with 7 facets.

For each nonnegative integer m we show that any closed, oriented topological four-manifold with fundamental group Z_{4m+2} and odd intersection form, with possibly seven exceptions, either admits no smooth structure or admits infinitely…

Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra. In…

We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have…

We construct CW spheres from the lattices that arise as the closed sets of a convex closure, the meet-distributive lattices. These spheres are nearly polytopal, in the sense that their barycentric subdivisions are simplicial polytopes. The…

3D-facets of the Delone cells representing the deep and shallow holes of the root lattice D6 which tile the six-dimensional Euclidean space in an alternating order are projected into three-dimensional space. They are classified into six…

Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This second one applies the powerful tool of trigonometric Diophantine equations to classify the case of…