Fullerenes
From CanisiusmathWiki
| Table of contents |
Abstract
Fullerenes determine graphs where the primitive loops are pentagons or hexagons. We consider spherical (classical), toroidal and kleinian fullerenes, and we study their spectral properties. As an application, we write infinite fullerenes as limits of finite toroidal fullerenes, and we use this information to compute the Ihara zeta function.
Some General Background Information
Fullerenes are geometric structures that are composed of, in the classical sense, 12 pentagons and n = 0, 2, 3, 4, ... hexagons which preserve 3-regularity across the entire structure. They are of particular interest to chemists since they model the bonding of carbon molecules in spherical and tubular form. The Bucky Ball or C60 is the first fullerene that has isolated pentagons, a necessary condition for the construction of spherical carbon molecules. We hope to investigate the mathematical properties of fullerenes, infinite fullerenes, fullerenes on other topological structures, and the Ihara Zeta function.
Infinite Fullerenes
Infinite fullerenes come from tiling the infinite plane with hexagons and less than or equal to 6 pentagons. When there is zero or one pentagon, there is a unique solution to the tiling but when there are 2 to 6 pentagons there will be infinite solutions.
For an infinite tilling, choose a vertex and count all vertices that are a walk n away; let
denote the number of vertices that can be reached with a walk of length n. With zero pentagons, a graphite sheet is produced, and using the method of walks produces the equation
. For the other tilings an equation is not possible to be derived due to the lack of symmetry; the method however allows for infinite fullerenes to be compared to finite ones.
If we let the number of vertices, n, approach infinity, then we can use tilings of the plane as an isomorphism of finite fullerenes. For construction of infinite fullerenes assume that IPR standards are necessary; pentagons spaced out symmetrically along the fullerene are non-adjacent. Using this assumption and the fact that since the pentagonal faces are an infinite distance apart, then each region can be made isomorphic to the plane tiled with hexagons and 1 pentagon. These fullerenes that are produced can be labeled as
as the other IPR fullerenes are labeled; but they are not constructible in the lab due to their instability.
If we instead force the pentagons to lie in pairs where members of the pairs are a finite distance apart then this region will be isomorphic to the tiled plane with 2 pentagons that are a finite distance apart.
Covers of Fullerenes
Statement: Fullerenes can be embedded in the sphere,
, the torus,
, the klein bottle,
, and the projective plane
; the number of pentagons on each surface is 12, 0, 6, and 0, respectively.
Proof: Using the euler characteristic equation,
, where
is the number of vertices,
is the number of edges, and
is the number of faces, the number of pentagons for each surface can be determined. First, note that,
due to fullerenes being 3 regular.
Now let
for orientable surface and
for non-orientable surfaces.
For
.
For
.
For
.
For
.
Since it is at least very difficult for a fullerene to cover another fullerene in
or
, due to the presence of 12 and 6 pentagons in all
and
respectively and the restriction of three valency, we will focus on fullerenes in
and
.
Statement: In
there will always be a fullerene that covers another fullerene.
Proof: For
we proved above that there were no pentagonal faces, so a fullerene,
is composed entirely of hexagons. Since
is made entirely of hexagons it can just be considered as a tiling. Now allow
to have an arbitrary number of hexagons. One can now cut
once horizontally and once vertically such that no edges are broken. This produces a tilling of the rectangle
which recovers
when the sides are identified. Now make a copy of
and label it
. Glue the right side of
to the left side of
. Because of the properties of
and
, we obtain a tilling
of the parallelogram with hexagons, except at the edges. Again by the properties of
and
, we obtain a tilling of the torus when we identify the sides appropriately. The map
induces a map
between a fullerene
, which is produced by
, and
. We will show that
is a graph covering map. It is obvious that
is a graph map. We need to check the neighborhood condition: For each vertex
in
, induces a bijection between
and
. This is obvious for the vertices on the interior of
and
. Also it is obvious for vertices on the `horizontal' sides of the squares. So we need to check the condition for
on the vertical sides of
and
. Now let
be a glued vertex on the right edge of
and the left edge of
. Because of the way that
is formed, the neighborhood of
in
is isomorphic to the neighborhood of
in
. Thus
. Now let
be another glued vertex that lies to the right of
and the left of
. The same argument works in this case because of the way that
is formed. Thus
is a double covering map.
Statement: In
there will always be a fullerene that covers another fullerene.
Proof: The proof for this is similar to the one above except for the fact that the copy of
,
, will be mirrored left to right along the axis of similar orientation and then glued.
Toridal Fullerenes
Fullerenes on the torus are analogous to tiling a plane with all hexagons; to facilitate our exploration of this subject the following code for Mathematica (which can be extended to other languages with little work) was produced which gives the adjacency matrix for toroidal fullerenes.
In[1]:
(*user input, number of hexagons vertical and horizontal*)
vertical = ???;
horizontal = ???;
(*end of user input*)
modding = vertical*4;
tempTable := Flatten[
{(*1*) Mod[i, modding] == 1 && (i == j - 1 || i == j - (modding/2 - 1)),
(*mid+1*) Mod[i, modding] == ((modding/2) + 1) && (i == j - 1 ||i == j - ((modding/2) - 1) || i == j - (modding/2)),
(*mid*) Mod[i, modding] == modding/2 && i == j - modding/2,
(*endc*) Table[i == z && j == horizontal*vertical*2 - (modding/2 - z), {z, 1, modding/2, 2}],
(*col1*) Table[Mod[i, modding] == z && i == j - 1, {z, 3, modding/2, 2}],
(*col2*) Table[Mod[i, modding] == z && (i == j - modding/2 || i == j - 1), {z, 2, (modding/2) - 2,2}],
(*col3*) Table[Mod[i, modding] == z && i == j - 1, {z, modding/2 + 2, modding - 1, 2}],
(*col4*) Table[Mod[i, modding] == z && (i == j - 1 || i == j - modding/2), {z, modding/2 + 1, modding - 1, 2}]}, 3];
J[i_, j_] := If[Apply[Or, tempTable], True, False];
A = Table[If[J[i, j], 1, 0], {i, 1, horizontal*vertical*2}, {j, 1, horizontal*vertical*2}]; A = A + Transpose[A];
(*code for graphics modified from wolfram example*)
h[x_, y_] := Polygon[Table[{Cos[2 Pi k/6] + x, Sin[2 Pi k/6] + y}, {k, 6}]];
graph = Graphics[{EdgeForm[Opacity[.7]], LightBlue, Table[h[3 i + 3 ((-1)^j + 1)/4, Sqrt[3]/2 j], {i, vertical}, {j, horizontal}]}];
Print[graph];
Print["Characteristic Polynomial"]; Print[CharacteristicPolynomial[A, x]];
Print["Determinant"]; Print[Det[A]];
Print["Eigenvalues"]; Print[Eigenvalues[A]];
Print["Adjacency Matrix"]; Print[MatrixForm[A]];
The preceding code will produce adjacency matrices, and from that any number of graph theory calculations, for hexagonal lattices. The user must replace ??? with integers. The following is a sample output for vertical = 3 and horizontal = 2 and its cover vertical = 3 and horizontal = 4.
Observations about Eigenvalues
Note: These are merely conjectures observed from a limited number of examples
Let
be a fullerene described by the hexagonal tiling
, where
. This produces a covering sequence,
, where Fn + 1 is simply the double cover of Fn. Then,
- There will always be
. This is trivial due to the regularity of fullerenes.
- If m | 2, then
with order 2n + 1.
- The λ's for
. This result is also trivial due to Fn | (Fn + 1.
- For
- If you let all operands be either plus or minus, this sequence approaches
.
Statement:
Proof: First let
. S by construction is a monotone increasing function with
. To prove this let
. Since S is bounded and monotone increasing a limit, L exists. Let
. Now
.
- As result of the previous finding we can say that the spectral gap goes to zero.
- After the first several covers in this sequence all the unique eigenvalues seem to appear, and after that only a similar pattern to the above holds.
- All eigenvalues come in plus/minus pairs. This indicates that they are centered at 0 which means that the graph is bipartite. This holds since for all
there are no odd cycles.
Ihara Zeta Function For Finite Fullerenes
First the Ihara Zeta function, an analogue for the Riemann Zeta Function, is defined as
where
is the equivalence classes of closed, prime paths and
is the number of closed loops of length r that are oriented (oriented meaning that loops do not overlap and the starting point of loops do not matter). Now assume that the graph will be k-regular. By Bass' Theorem, the Ihara Zeta function can expressed as
where
is the Markov operator on
and
is the degree. Because fullerenes are 3-regular, letting k = 3 yields
The Ihara zeta function can also be expresed as a product of eigenvalues:
Using Mathematica, we are able to quickly find the Ihara zeta function for a number of toroidal fullerenes. Below is the Ihara zeta function for a "2,2" fullerene:
Ihara Zeta Function For Infinite Fullerenes
We can extend the Ihara Zeta Function for infinite graphs and look for the limit.
Let
be a fullerene where
such that
is a finite graph covering sequence (i.e. Fn + 1 is a graph cover for Fn). Now let
where α is the number of vertices; thus | Fn | = 2n − 1α.
We are now exploring the equation:
To look at the limit of the function we explored graph covering families in the form of
, vertical by horizontal hexagons on the sliced open fullerene, where
and
. Below we graphed some of the examples, examples include n = 1,2,3,4,5 in respect from bottom to top.
Allowing Heptagons
Statement: The embedding of pentagons, hexagons, and heptagons in the sphere,
, the torus,
, the klein bottle,
, and the projective plane
will result in
,
,
, and
respectively.
Proof: Using the euler characteristic equation,
, where
is the number of vertices,
is the number of edges, and
is the number of faces, the number of pentagons and heptagons for each surface can be determined. First, note that
due to fullerenes being 3 regular.
Now let
for orientable surface and
for non-orientable surfaces.
For
.
For
.
For
.
For
.


