Related papers: Exact enumeration of fullerenes
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,…
Let $B_{x}\subseteq\mathbb{R}^{n}$ denote the Euclidean ball with diameter $[0,x]$, i.e. with with center at $\frac{x}{2}$ and radius $\frac{\left|x\right|}{2}$. We call such a ball a petal. A flower $F$ is any union of petals, i.e.…
Fullerene graphs, i.e., 3-connected planar cubic graphs with pentagonal and hexagonal faces, are conjectured to be Hamiltonian. This is a special case of a conjecture of Barnette and Goodey, stating that 3-connected planar graphs with faces…
We observe that fullerene graphs are one-skeletons of polyhedra, which can be realized with all dihedral angles equal to $\pi/2$ in a hyperbolic 3-dimensional space. One of the most important invariants of such a polyhedron is its volume.…
A ball polyhedron is a finite intersection of congruent balls in $\mathbb{R}^3$. These shapes arise in various contexts in discrete and convex geometry. We focus on Reuleaux polyhedra, the subclass of ball polyhedra whose centers and…
A tiling of the sphere by triangles, squares, or hexagons is convex if every vertex has at most 6, 4, or 3 polygons adjacent to it, respectively. Assigning an appropriate weight to any tiling, our main result is explicit formulas for the…
An i-hedrite is a 4-regular plane graph with faces of size 2, 3 and 4. We do a short survey of their known properties and explain some new algorithms that allow their efficient enumeration. Using this we give the symmetry groups of all…
We develop an exact wavelet transform on the three-dimensional ball (i.e. on the solid sphere), which we name the flaglet transform. For this purpose we first construct an exact transform on the radial half-line using damped Laguerre…
Fullerenes are molecules in the form of cage-like polyhedra, consisting solely of carbon atoms. Fullerene graphs are mathematical models of fullerene molecules. The transmission of a vertex $v$ of a graph is the sum of distances from $v$ to…
We summarise the construction of exact axisymmetric scale-discretised wavelets on the sphere and on the ball. The wavelet transform on the ball relies on a novel 3D harmonic transform called the Fourier-Laguerre transform which combines the…
We consider the following question, motivated by the enumeration of fullerenes. A fullerene patch is a 2-connected plane graph G in which inner faces have length 5 or 6, non-boundary vertices have degree 3, and boundary vertices have degree…
A graph is said to be cyclic $k$-edge-connected, if at least $k$ edges must be removed to disconnect it into two components, each containing a cycle. Such a set of $k$ edges is called a cyclic-$k$-edge cutset and it is called a trivial…
In connection with our previous investigation about Siegel threefolds which admit a Calabi--Yau model, we consider ball quotients which belong to the unitary group $\U(1,3)$. In this paper we determine a very particular example of a Picard…
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…
We mathematically investigate four molecular models of buckminsterfullerene (C60) discussing the strengths and weaknesses of each, and a new orthorhombic 20-dodecahedron model is proposed to replace the traditional truncated icosahedron…
A triangular graphenic billiard is defined as a planar carbon polymer in the H\"uckeloid approximation of $\pi-$band electrons. It is shown that the equilateral triangle of arbitrary size and zig-zag edges allows for exact solutions of the…
The bounce spectrum of a polygonal billiard table is the collection of all bi-infinite sequences of edge labels corresponding to billiard trajectories on the table. We give methods for reconstructing from the bounce spectrum of a polygonal…
The lectures are devoted to a remarkable class of $3$-dimensional polytopes, which are mathematical models of the important object of quantum physics, quantum chemistry and nanotechnology -- fullerenes. The main goal is to show how results…
A polygonal complex in euclidean 3-space is a discrete polyhedron-like structure with finite or infinite polygons as faces and finite graphs as vertex-figures, such that a fixed number r of faces surround each edge. It is said to be regular…
A zigzag in a plane graph is a circuit of edges, such that any two, but no three, consecutive edges belong to the same face. A railroad in a plane graph is a circuit of hexagonal faces, such that any hexagon is adjacent to its neighbors on…