Abstract
In this article, we analyze the spectrum of discrete magnetic Laplacians (DML) on an infinite covering graph with (Abelian) lattice group and periodic magnetic potential . We give sufficient conditions for the existence of spectral gaps in the spectrum of the DML and study how these depend on . The magnetic potential can be interpreted as a control parameter for the spectral bands and gaps. We apply these results to describe the spectral band/gap structure of polymers (polyacetylene) and nanoribbons in the presence of a constant magnetic field.
Keywords:
discrete magnetic Laplacian; covering graphs; spectral gaps; polymers; nanoribbons; magnetic field MSC:
05C50, 05C63, 47B39, 47A10
1. Introduction
It is a well-known fact that the spectrum of Laplacians or, more generally, Schrödinger operators with periodic potentials, on Abelian coverings, have band structure. These properties of the Laplacians are discussed, e.g., in [1,2] and the references therein. The spectrum consists of a continuous part (which is the union of intervals or spectral bands separated by gaps) and a set of eigenvalues with infinite multiplicity. The spectrum is described in terms of a so-called Floquet (or Bloch) parameter. This parameter is the dual of the Abelian group acting on the structure. If two consecutive spectral bands of a bounded self-adjoint operator T do not overlap, then we say that the spectrum has a spectral gap, i.e., a maximal nonempty interval that does not intersect the spectrum of the operator. The study of the spectral bands/gaps is a quite natural situation in several fields of mathematics and physics. In solid-state physics, where—for example in semiconductors or its optical counterparts, photonic crystals—the operators modeling the dynamics of particles have some forbidden energy regions (see, e.g., [3,4]). In band-gap engineering, a process to control de band/gap of some materials, for semiconductors is controlled for example with the composition of alloys [5], and for the nanoribbons with temperature [6], etc. Depending on the type of the periodic structure involved, spectral gaps may be produced by deformation of the geometry (cf., [7,8,9]) or by a suitable periodic decoration of the metric or the discrete covering graph (see, e.g., [10,11,12,13,14] and ([15], Section 4)).
The study of energy-gaps has been widely studied. The gaps in nanoribbons as a function of the width can be found in [16]. The gaps in the armchair structure can appear because quantum confinement and for the zigzag structure can appear because of an edge magnetization [17].
In this article, we study the spectrum of discrete magnetic Laplacians (DMLs for short) on infinite discrete coverings graphs
where is an (Abelian) lattice group acting freely and transitively on (also the graph is called as -periodic graph with finite quotient ). We will present our analysis for graphs with arbitrary weights m on vertices and arcs although the graphs presented in the examples of the last section will initially have standard weights which are more usual in the context of mathematical physics. Also, we consider a periodic magnetic potential on the arcs of the covering graph modeling a magnetic field acting on the graph.
We denote a weighted graph as , and a magnetic weighted graph (MW-graph for short) is a weighted graph together with a magnetic potential acting on its arcs. Any MW-graph with magnetic potential has canonically associated a DML denoted as . We say that with magnetic potential is a -periodic MW-graph if is a -covering and and are periodic with respect to the group action.
In this article, we generalize the geometric condition obtained in ([18], Theorem 4.4) for to non-trivial periodic magnetic potentials. In particular, if is a -periodic MW-graph with magnetic potential , we will give in Theorem 3 a simple geometric condition on the quotient graph that guarantees the existence of non-trivial spectral gaps on the spectrum of the discrete magnetic Laplacian . To show the existence of spectral gaps, we develop a purely discrete spectral localization technique based on the virtualization of arcs and vertices on quotient . These operations produce new graphs with, in general, different weights that allow localizing the eigenvalues of the original Laplacian inside certain intervals. We call this procedure discrete bracketing, and we refer to [18] for additional motivation and proofs.
One of the new aspects of the present article is the generalization of results in [18] to include a periodic magnetic field on the covering graph . In this sense, may be used as a control parameter for the system that serves to modify the size and the regions where the spectral gaps are localized. We apply our techniques to the graphs modeling the polyacetylene polymer as well as to graphene nanoribbons. The nanoribbons are -periodic strips of graphene either with an armchair or zig-zag boundaries (see, e.g., Figure 5). The graphic in Figure 1 corresponds to an armchair nanoribbon with a width 3. It can be seen how a periodic magnetic potential with constant value on each cycle (and plotted on the horizontal axis) affects the spectral bands (gray vertical intervals that appear as the intersection of the region with a line ) and the spectral gaps (white vertical intervals). We refer to Section 5.2 for additional details of the construction.
Figure 1.
The structure of the bracketing intervals J is represented with gray bands and the spectral gaps with white bands. Both bands depend on the constant (periodic) magnetic potential acting on 3-aGNR.
In the case of the polyacetylene polymer, we find a spectral gap that is stable under perturbation of the (constant) magnetic field. Moreover, if the value of the magnetic field is , then the spectrum of the DML degenerates to four eigenvalues of infinite multiplicity. This discrete model suggests that a varying uniform magnetic field may drastically change the conductance of a material arranged as a periodic planar graph.
The article is structured in five sections as follows. In Section 2, we collect the basic definitions and results on discrete weighted multigraphs (graphs which may have loops and multiple arcs). We consider discrete magnetic potentials on the arcs and define the discrete magnetic Laplacian on the graph, which will be the central operator in this work. In Section 3, we present a spectral relation between finite MW-graphs based on an order relation between the eigenvalues of the corresponding DMLs. Moreover, we will present the basic arc and vertex virtualization procedure that will allow one to localize the spectrum of the DML on the infinite covering graph. In Section 4, we extend the discrete Floquet theory considered in ([18], Section 5) to the case of covering graphs with periodic magnetic potentials. In Section 5, we apply the spectral localization results developed before in the example of -periodic graphs modeling the polyacetylene polymer as well as graphene nanoribbons in the presence of a constant magnetic field.
2. Weighted Graphs and Discrete Magnetic Laplacians
In this section, we introduce the basic definitions and results concerning MW-graphs and also define discrete magnetic Laplacians. For further motivation and results, we refer to [12,18,19] and references cited therein.
We denote by a (discrete) directed multigraph which in the following we call simply a graph; here is the set of vertices and the set of arcs. The orientation map is given by and is the pair of the initial and terminal vertices. Graphs are allowed to have multiple arcs, i.e., arcs with or as well as loops, i.e., arcs with . Moreover, we define
With this notation, the degree of a vertex is and a loop increases the degree by 2.
Given subsets , we define
Moreover, we put and .
To simplify the notation, we write instead of etc. Note that loops are not counted double in , in particular, is the set of loops based at the vertex . The Betti number of a finite graph is defined as
To study the virtualization processes of vertices, arcs and the structure of covering graphs, we will need to introduce the following substructures of a graph.
Definition 1.
Let be a graph and denote by a triple such that , and .
- (a)
- If , we say that is a partial subgraph in . We callthe set of connecting arcs of the partial subgraph in .
- (b)
- If , then is a subgraph of
Note that, in general, a partial subgraph is not a graph as defined above, since we may have arcs with . We do exclude though the case that and . The arcs not mapped into under are precisely the connecting arcs of in . Partial subgraphs appear naturally as fundamental domains of covering graphs (cf., Section 4) (Note that we use the name partial subgraph in a different sense as in usual combinatorics literature).
Let be a graph; a weight on is a pair of functions denoted by a unique symbol m on the vertices and arcs and such that is the weight at the vertex v and is the weight at . We call a weighted graph. It is natural to interpret m as a positive measure and consider for any . The relative weight is defined as
In order to work with bounded discrete magnetic Laplacians, we will assume that the relative weight is uniformly bounded, i.e.,
The most important and intrinsic examples of weights are
- Standard weight:, , and , , so that .
- Combinatorial weight:, , hence and .
Giving a weighted graph , we associate the following two natural Hilbert spaces which we interpret as 0-forms and 1-forms, respectively.
with corresponding inner products
Let be a graph; a magnetic potential acting on is a -valued function on the arcs as follows, We denote the set of all vector potentials on just by . We say that two magnetic potentials and are cohomologous, and denote this as , if there is with
Given a , we say that a magnetic potential has support in if for all . We call the class of weighted graphs with magnetic potential MW-graphs for short.
It can be shown that any magnetic potential on a finite graph can be supported in many arcs. For example, if is a cycle, any magnetic potential is cohomologous to a magnetic potential supported in only one arc. Moreover, if is a tree, any magnetic potential acting on is cohomologous to 0.
The twisted (discrete) derivative is the following linear operator mapping 0-forms into 1-forms:
Now, we present the following geometrical definition of Laplacian with magnetic field as a generalization of the discrete Laplace-Beltrami operator.
Definition 2.
Let be a weighted graph with a vector potential. The discrete magnetic Laplacian (DML for short) is defined by , i.e., by
where is the oriented evaluation and is the vertex opposite to v along the arc e, i.e.,
If we need to stress the dependence of the operator of the weighted graph , we will denote the DML as .
From this definition, it follows immediately that the DML is a bounded, positive and self-adjoint operator. Its spectrum satisfies and, in contrast to the usual Laplacian without magnetic potential, the DML depends on the orientation of the graph. If , then and are unitary equivalent; in particular, . Moreover, if then where denotes the usual discrete Laplacian (with vector potential 0). For example, if and is a tree, then for any magnetic potential .
3. Spectral Ordering on Finite Graphs and Magnetic Spectral Gaps
In this section, we will introduce a spectral ordering relation ≼, which is invariant under unitary equivalence of the corresponding operators. Moreover, we will introduce two operations on the graphs (virtualization of arcs and vertices) that will be used later to develop a spectral localization (bracketing) of DML on finite graphs. This technique will finally be applied to discuss the existence of spectral gaps for magnetic Laplacians on covering graphs. We refer to [11,12,18] for additional motivation and examples. For proofs of the results stated in this section see ([18], Sections 3 and 4).
Let be a weighted graph. Throughout this section, we will assume that . We denote the spectrum of the DML by , where we will write the eigenvalues in ascending order and repeated according to their multiplicities, i.e.,
Definition 3.
Let and be two finite MW-graphs of order and , respectively, and magnetic potential . Consider the eigenvalues of the DMLs written in ascending order and repeated according to their multiplicities.
- (a)
- We say that is spectrally smaller than (denoted by ), ifwhere we put for (the maximal possible eigenvalue).
- (b)
- Consider as above with . We define the associated k-th bracketing interval byfor .
Given an MW-graph, we introduce two elementary operations that consist of virtualizing arcs and vertices. The first one will lead to a spectrally smaller graph.
Definition 4
(virtualizing arcs). Let be a weighted graph with magnetic potential α and . We denote by the weighted subgraph with magnetic potential defined as follows:
- (a)
- with for all ;
- (b)
- with and for all ;
- (c)
- , .
We call the weighted subgraph obtained from by virtualizing the arcs . We will sometimes denote the weighted graph simply by and we write the corresponding discrete magnetic Laplacian as .
The second elementary operation on the graph will lead now to a spectrally larger graph.
Definition 5
(virtualizing vertices). Let be a weighted graph with magnetic potential α and . We denote by the weighted partial subgraph with magnetic potential defined as follows:
- (a)
- with for all ;
- (b)
- with for all ;
- (c)
- , .
We call the weighted partial subgraph obtained from by virtualizing the vertices . We will denote it simply by . The corresponding discrete magnetic Laplacian is defined by
with
It can be shown that the operator is the compression of onto a -subspace.
The previous operations of arc and vertex virtualization will be used to localize the spectrum of intermediate DMLs. Before summarizing the technique in the next theorem, we need to introduce the following notion of vertex neighborhood of a family of arcs.
Definition 6.
Let be a graph and . We say that a vertex subset is in the neighborhood of if , i.e., if or for all .
Later on, will be the set of connecting arcs of a covering graph, and we will choose to be as small as possible to guarantee the existence of spectral gaps (this set is in general not unique).
Theorem 1.
Let be a finite MW-graph with magnetic potential α and . Then, for any subset of vertices in a neighborhood of we have
where with and with . In particular, we have the spectral localizing inclusion
By construction, it is clear that the bracketing depends on the magnetic potential . In Section 5, we show in some examples how the localization intervals change under the variation of the magnetic potential (see, e.g., Figure 3). However, if the magnetic potential has support on the virtualized arcs , then J will not depend on because .
Next, we make precise some notions concerning spectral gaps that will be needed when we study covering graphs. Recall that , where denotes the supremum of the relative weight, (cf., Equation (3)).
Definition 7.
Let be a weighted graph.
- (a)
- The spectral gaps set of is defined bywhere denotes the resolvent set of the operator .
- (b)
- The magnetic spectral gaps set of is defined by
where the union is taken over all the magnetic potential α acting on .
The following elementary properties follow directly from the definition: . In particular, if , then or, equivalently, if , then . Moreover, if is a tree, then , as all DMLs are unitary equivalent with the usual Laplacian .
Up to now, we have seen that arc/vertex virtualization will produce graphs that allows localizing the spectrum of the DML of any intermediate MW-graph satisfying
4. Periodic Graphs and Spectral Gaps
In this section, we will study the spectrum of the DML of an infinite covering graph with periodic magnetic potential in terms of its Floquet decomposition. In Proposition 2 the Floquet parameter of the covering graph is identified with a suitable set of magnetic potentials on the quotient (cf., Definition 10). This approach generalizes results in ([18], Section 5) to include Laplacians on the infinite covering graph with a periodic magnetic potential . Finally, in Theorem 2, we state a bracketing technique to localize the spectrum.
4.1. Periodic Graphs and Fundamental Domains
Let be an (Abelian) lattice group and consider the -covering (or -periodic) graph
We assume that acts freely and transitively on the connected graph with finite quotient (see also ([20], Chapters 5 and 6) or [18,21]). This action (which we write multiplicatively) is orientation preserving, i.e., acts both on and such that
In particular, we have , , .
In addition, we will study weighted covering graphs with a periodic weight and periodic magnetic potential , i.e., we consider an MW-graph such that for any we have
Note that, by definition, the standard or combinatorial weights on a covering graph satisfy the invariance conditions on the weights. A -covering weighted graph naturally induces a weight m and a magnetic potential on the quotient graph , given by and .
We define next some useful notions in relation to covering graphs (see, e.g., [18], Section 5 as well as ([22], Sections 1.2 and 1.3) and [8]).
Definition 8.
Let be a Γ-covering graph.
- (a)
- a vertex, respectively arc fundamental domain on a Γ-covering graph is given by two subsets and satisfyingwith (i.e., an arc in has at least one endpoint in ). We often simply write D for a fundamental domain, where D stands either for or .
- (b)
- a (graph) fundamental domain of a covering graph is a partial subgraph (cf., Definition 1)where and are vertex and arc fundamental domains, respectively. We callthe set of connecting arcs of the fundamental domain in .
Remark 1.
- (a)
- Fixing a fundamental domain on the covering graph and the group Γ will be used to give coordinates (to the arcs and vertices) on the covering graph .In fact, given a specific fundamental domain in a Γ-covering graph , we can write any uniquely as for a unique pair . This observation follows from the fact that the action is free and transitive. We call the Γ-coordinate of v (with respect to the fundamental domain ). Similarly, we can define the coordinates for the arcs: any can be written as for a unique pair . In particular, we have
- (b)
- Once we have chosen a fundamental domain , we can embed into the quotient of the covering bywhere and denote the Γ-orbits of v and e, respectively. By definition of a fundamental domain, these maps are bijective. Moreover, if in , then also in , i.e., the embedding is a (partial) graph homomorphism.
Definition 9.
Let be a Γ-covering graph with fundamental graph . We define the index of an arc as
In particular, we have , and iff , i.e., the index is only non-trivial on the (translates of the) connecting arcs. Moreover, the set of indices and its inverses generate the group .
Since the index fulfils for all by (a) in Remark 1, we can extend the definition to the quotient by setting for all . We denote also .
4.2. Discrete Floquet Theory
Let be a weighted -covering graph and fundamental domain with corresponding weights inherited from . In this context one has the natural Hilbert space identifications
Floquet theory uses a partial Fourier transformation on the Abelian group that can be understood as putting coordinates on the periodic structure and allows to decompose the corresponding operators as direct integrals. Concretely, we consider
for and where denotes the character group of . We adapt to the discrete context of graphs with periodic magnetic potential the main results concerning Floquet theory needed later. See, e.g., ([7], Section 3) or [22] for details, additional motivation and references.
For any character consider the space of equivariant functions on vertices and arcs
These spaces have the natural inner product defined on the fundamental domains and :
The definition of the inner product is independent of the choice of the fundamental domain (due to the equivariance). We extend the standard decomposition to the case of the DML with periodic magnetic potential (see, for example, [22,23]).
Proposition 1.
Let be a covering weighted graph where and is a periodic magnetic potential. Then there are unitary transformations
such that
where equivariant Laplacian (fiber operators) are defined as .
Proof.
Consider the twisted derivative specified in Equation (4) and the equivariant twisted derivative on the fiber spaces defined by
It is straightforward to check that if , then and that . Moreover, we will show that the unitary transformations intertwine these two first order operators, i.e.,
In fact, this is a consequence of the following computation that uses the invariance of the magnetic potential. For any and
This shows that
hence, . □
4.3. Vector Potential as a Floquet Parameter
The following result shows that in the case of Abelian groups , we can interpret the magnetic potential on the quotient graph partially as a Floquet parameter for the covering graph (see (b) in Remark 1). Moreover, recalling the definition of coordinate giving in (a) in Remark 1) we can define the following unitary maps (see also [24] for a similar definition in the context of manifolds):
It is straightforward to check that and are well defined and unitary.
Definition 10.
Let be a covering graph with periodic weights , periodic magnetic potential and fundamental domain . We denote by α a magnetic potential acting on the quotient . We say that α has the lifting property if there exists such that:
We denote the set of all the magnetic potentials with the lifting property as .
Proposition 2.
Consider a Γ-covering graph with periodic magnetic potential , where , and is a fundamental domain. Then
Proof.
By Proposition 1, it is enough to show
To show the inclusion “⊂” consider a character and define a magnetic potential on as follows
Then we have
On the other hand, we have
Therefore, the intertwining equation holds if
or, equivalently, if
But this equation is true by definition of the magnetic potential on given in Equation (10). Finally, since and , then it is clear that these Laplacians are unitary equivalent.
To show the reverse inclusion “⊃” let and is such that is a basis of the group . Then define
and we can extend to all multiplicatively, so that . As before, we can show then and the proof is concluded. □
4.4. Spectral Localization for the DML on a Covering Graph
We apply now the technique stated in Theorem 1 to covering graphs.
Theorem 2.
Let be a Γ-covering graph and a periodic magnetic potential. Consider a fundamental domain and with magnetic potential β, where . The functions m and β are induced by and respectively. Let
be the image of the connectivity arcs on the quotient and in the neighborhood of . Define by
the corresponding arc and vertex virtualized graphs, respectively. Then
where the eigenvalues of and are written in ascending order and repeated according to their multiplicities.
Proof.
By Proposition 2 we have
Now, by the bracketing technique of Theorem 1, we have for any potential with the lifting property (cf., Definition 6):
Therefore, by Equation (7)
since has the lifting property, Equation (8) implies that there exists such that:
But for all the index is trivial, i.e., (see Remark 1). Thus by -periodicity we obtain that for all arcs . Since and are magnetic potentials acting on , and then then . Similarly, for with in the neighborhood of , we have that . We obtain finally
Note that the last union does not depend anymore of and this fact concludes the proof. □
Note that the bracketing intervals depends on the fundamental domain . a right choice is one where the set of connecting arcs is as small as possible, providing high contrast between the interior of the fundamental domain and its boundary. In this case, we have a good chance that the localizing intervals do not cover the full interval . This choice is a discrete geometrical version of a “thin–thick” decomposition as described in [12], where a fundamental domain of the metric and discrete graph has only a few connections to its complement.
The next theorem gives a simple geometric condition on an MW-graph for the existence of gaps in the spectrum of the DML on the -covering graph. We will specify which arcs and vertices should be virtualized in to guarantee the existence of spectral gaps. This result generalizes the Theorem 4.4 in [18].
Theorem 3.
Let be a Γ-covering graph with a Γ-periodic magnetic potential . Denote by the quotient graph with induced magnetic potential β and induced weights m, respectively.
The spectrum of the DML has spectral gaps, i.e., , if the following condition holds: there exists a vertex and a fundamental domain such that the connecting arcs contain no loops, and
where is the relative weight at and with .
Proof.
Consider the following arc and vertex virtualized weighted graphs:
Then by Theorem 2, we obtain
To prove that , it is enough to show that the measure of is positive and it can be estimated from below by:
Therefore it is enough to calculate and (see [18], Proposition 3.3).
Step 1: Trace of . We define where . Recall that , ; the weights on and coincide with the corresponding weights on . The relative weights of are
where
The trace of is now
Step 2: Trace of . Let , then the trace of is given by
Remark 2.
- (a)
- If the graph has the standard weights, the condition becomes:where denote the cardinality of the set .
- (b)
- If we have the combinatorial weights, the condition becomes simply:
5. Examples
In this final section, we consider some examples of covering graphs used as models of important chemical compounds, like the polyacetylene and the graphene nanoribbons. The bracketing technique of Theorem 2 is used to localize the spectrum bands and gaps of the infinite covering graphs under the action of a periodic magnetic potential . In particular, we show the dependence of the spectral gaps on the periodic potential .
Let be a periodic graph. For simplicity, we consider here planar periodic magnetic potentials with the property that the flux through all cycles on is constant and equal to s for some . Two magnetic potentials are cohomologous if and only if they induce the same flux through all the cycles on the graph. Then, any periodic function on the arcs is identified with one unique value in . We call as a constant magnetic field with value s. a similar analysis could be done for non-constant magnetic potentials.
Let be a periodic weighted graph with a constant magnetic field. The graph models polyacetylene in Section 5.1 as well as nanoribbons with different symmetries in Section 5.2. In order to study the spectrum , we will use the results in Section 4 to obtain bracketing intervals localizing the spectrum and showing the existence of spectral gaps.
5.1. Polyacetylene with Magnetic Field
For the first illustration of the existence of spectral gaps for covering graphs with periodic magnetic potential, we study the graph modeling polyacetylene. This compound is an organic polymer that consists of a chain of carbon atoms (white circles) with alternating single and double bonds between them, each with one hydrogen atoms (black vertex). We denote this MW-graph as , where is the graph in Figure 2a. The polyacetylene belongs to the family of polymers, a chemical compound in long repeated chains modeled by covering graphs. The polymers have relevant electrical properties (see, e.g., [25,26] and references therein). In particular, the polyacetylene is a simple polymer with good electric conductance (cf., [27]). In [18] is studied the spectrum of the Laplacian in the infinite polyacetylene graph without any magnetic field. Applying the results of Section 4, we can now study the spectrum of the DML in the polyacetylene graph under the action of a periodic magnetic potential, in particular, the size and localization of the spectral gaps. For the polyacetylene we will prove the following facts:
Figure 2.
Spectral gaps of the polyacetylene graph for a constant magnetic potential . Here, J is the spectral localization for the pair and . Bipartiteness gives a finer localization . In this case, we obtain the spectrum almost exactly, except for the spectral value 1.
- Fact 1. Let be the standard weights and a constant periodic magnetic potential. We show how to apply the bracketing technique to localize the spectrum for a specific value of the magnetic potential (equal to ) and then, how the bracketing intervals change as a function of . We will show the existence of spectral gaps.
- Fact 2. Let be the combinatorial weights and a periodic magnetic potential (not necessarily constant). Using the condition on in Equation (17), we show the existence of spectral gaps.
- Fact 3. Let be the standard weights, we show the existence of periodic magnetic spectral gaps, i.e., a spectral gap which is stable under any perturbation of the constant periodic magnetic field.
Fact 1. We define a periodic magnetic potential acting as in Figure 2a, i.e., the potential acts only on the cycles defined by the double bonds. Observe that the action of any constant magnetic field on the polymer can be described by putting a suitable value s for the magnetic potential as in Figure 2a. To be concrete, we put first the value and want to specify the band/gap structure of the spectrum . The graph in Figure 2a is the infinite covering of the finite graph in Figure 2b. This graph is bipartite and has Betti number 2. In this case, if with m the standard weights, we have by Proposition 2 that
where is a magnetic potential acting on the quotient with , and zero in all the other arcs. Define and , so that is in the neighborhood of (see Definition 6). Then we construct and as before virtualizing arcs and vertices, i.e., and as in Figure 2c. The induced weights is defined as in Definition 4 and as in Definition 5. Using the notation of the Theorems 1 and 2 we get , where J is the union of the localizing intervals (see Figure 2d for the case of ). Since is bipartite, we have the symmetry of spectrum under the function (cf., [12], Proposition 2.3), hence we also have . Therefore, the intersection gives a finer localization of the spectrum, i.e., we obtain finally . In this example, our method works almost perfectly, since we can determine almost precisely the spectrum:
In conclusion, given a covering graph with a periodic magnetic potential (see Figure 2 for ), we were able to determine just by specifying the localization of the spectrum given by (and without computing explicitly the spectrum). It is clear that J depends on and therefore of the value of s. Therefore for each value of , we can construct a bracketing of intervals for the spectrum of and since in this case, we have the reflection symmetry specified by and using the Cauchy’s theorem, it is proved [28] that the eigenvalues of and the eigenvalues of are interlaced, therefore we can give a much more precise localization of the spectrum. In Figure 3 we plot the spectrum of the DML as a function of the periodic magnetic potential varying within the interval . Here one can appreciate how the size of the gaps and their localization within the interval changes as a function of the external magnetic field.
Figure 3.
The horizontal axis represents the values of the magnetic potential acting on the polyacetylene polymer with standard weights. For any fixed we obtain the intervals J given by the bracketing technique as we did in the case in Figure 2 (and also using the symmetry given by the bipartiteness). In the vertical axis, we represent the spectral bands and gaps for each constant value .
Fact 2. We have proved using the bracketing technique that the polyacetylene with standard weights has spectral gaps for any constant periodic magnetic potential acting on it. Now, if we consider the polyacetylene with combinatorial weight, we will prove more easily the existence of spectral gaps for all periodic magnetic potentials (not necessarily constant). Formally, let be the MW-graph where is the polyacetylene (Figure 2a), are the combinatorial weights and any periodic magnetic potential. Let as in Fact 1, but now are also the combinatorial weights. First, we observe that , then we calculate from condition in Equation (17), i.e.,
then by Theorem 3 we have spectral gaps. Observe we do this without computing explicitly any eigenvalue.
Fact 3. Our method of virtualizing suitable arcs and vertices allows to proceed also alternatively. Define now and so that is a neighborhood of (see Definition 6). We construct as usual the MW-graphs and setting and as in Figure 4 and inducing the weights as in Definitions 4 and 5 (observe that in this case ). Using the notation of the Theorem 1 and Proposition 2 we observe now that the spectral localization intervals do not depend on the periodic magnetic potential. In fact, using the same idea that before we obtain
in particular, the interval is a spectral gap which is stable under any perturbation by the magnetic field. Finally, we note that if the magnetic potential has a constant value equal to then the spectrum degenerates to four eigenvalues with infinity multiplicity, i.e., the gaps consist of the whole interval except for the four eigenvalues. Under the influence of this particular value, the polyacetylene acts like an insulator.
Figure 4.
Using this graph and , we can find spectral gaps in common for all periodic magnetic potential acting on the polyethylene, represented by the covering graph .
5.2. Graphene Nanoribbons
In this subsection, we will apply our method to study the example of the graphene nanoribbons (GNRs), also known as nano-graphene ribbons or nano-graphite ribbons. These are strips of graphene with semiconductive properties which are very promising as nano-electronic devices (see, e.g., [29]). One of the most interesting fields of research of the nanoribbons is the energy gaps as a function of their widths. We refer, for example, to [6,16]. The GNRs repeat their geometry structure in two different ways and are represented as -covering graphs (see Figure 5).
Figure 5.
Two structures of the graphene nanoribbons: armchair and zigzag. These structures are covering graphs only in one direction.
- (i)
- The first variant is called armchair nanoribbon with a width equal to and denoted as -aGNR (see Figure 5). Consider for example the case of a 3-aGNR which has a similar structure as the poly-para-phenylene (PPP), one of the most important conductive polymers. Let be the MW-graph with standard weights where is the -covering graph representing the 3-aGNR and is a constant (periodic) magnetic potential, the idea is to use the bracketing technique to localize and we proceed as in the previous examples. Figure 6a is the finite quotient graph . Define in this case and so that is a neighborhood of (see Definition 6). We construct and as before: and (cf., Figure 6b). The weights are induced as in Definitions 4 and 5. Using again the notation of the Theorem 1 and Proposition 2 we obtain now a spectral localization J that depends on . Finally, in Figure 6c, we plot the spectral bands and gaps specified by J for the different values of the magnetic field within the interval . Observe that in this case, we do not have a spectral gap common to all values of (as we had for the polyacetylene).Figure 6. Spectral structure in bands/gaps of the magnetic Laplacian on the nanoribbons 3-aGNR. A constant magnetic potential is acting on the graph with value . Here, the bracketing intervals J gives a localization set of the spectrum, and this localization is given by the pair and , together with the bipartitness and interlacing.A similar analysis could be done for any -aGNR under the action of any periodic magnetic potential, and the bracketing technique will give good estimates of the intervals where the spectrum lies.Also, observe that for the combinatorial weights, we can show the existence of spectral gaps using the condition of Equation (17) as in Fact 2 in the polyacetylene example. We have in this case,
- (ii)
- The second variant is the so-called zigzag nanoribbon with a width equal to are denoted as -zGNR (see Figure 5). Consider the MW-graph with standard weights and is the graph given by the zigzag nanoribbons for a fixed , and acting on . In this case, our spectral localization method does not specify spectral gaps (i.e., the spectral bands overlap). The reason is that for any width the spectrum of the zigzag nanoribbons satisfy , i.e., in this case there are no spectral gaps. This fact is also confirmed by our method.
Author Contributions
Both authors contributed equally to the work.
Funding
J.S.F.-C. was supported by the Spanish Ministry of Economy and Competitiveness through project MTM2017-84098-P. F.L. was supported by the Spanish Ministry of Education through project DGI MTM2017-84098-P and the Severo Ochoa Program for Centers of Excellence in R&D (SEV-2015-0554).
Acknowledgments
It is a pleasure to thank Manuel Asorey for useful conversations on the graphene nanoribbons example of Section 5, during the IWIGQMA workshop in Grajera 2019, Spain.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Garnett, J.; Trubowitz, E. Gaps and bands of one dimensional periodic Schrödinger operators. Commentarii Mathematici Helvetici 1984, 59, 258–312. [Google Scholar] [CrossRef] [Scilit]
- Skriganov, M.M. The spectrum band structure of the three-dimensional Schrödinger operator with periodic potential. Invent. Math. 1985, 80, 107–121. [Google Scholar] [CrossRef] [Scilit]
- Kuchment, P. The mathematics of photonic crystals. Math. Model. Opt. Sci. 2001, 7, 207–272. [Google Scholar]
- Kuchment, P.; Kunyansky, L. Differential operators on graphs and photonic crystals. Adv. Comput. Math. 2002, 16, 263–290. [Google Scholar] [CrossRef] [Scilit]
- Smith, A.M.; Nie, S. Semiconductor nanocrystals: structure, properties, and band gap engineering. Acc. Chem. Res. 2009, 430, 190–200. [Google Scholar] [CrossRef] [Scilit]
- Han, M.Y.; Özyilmaz, B.; Zhang, Y.; Kim, P. Energy band-gap engineering of graphene nanoribbons. Phys. Rev. Lett. 2007, 98, 206805. [Google Scholar] [CrossRef] [Scilit]
- Lledó, F.; Post, O. Generating spectral gaps by geometry. Contemp. Math. 2007, 437, 159–169. [Google Scholar]
- Lledó, F.; Post, O. Existence of spectral gaps, covering manifolds and residually finite groups. Rev. Math. Phys. 2008, 20, 199–231. [Google Scholar] [CrossRef] [Scilit]
- Post, O. Periodic manifolds with spectral gaps. J. Diff. Equ. 2003, 187, 23–45. [Google Scholar] [CrossRef] [Scilit]
- Exner, P.; Kuchment, P.; Winn, B. On the location of spectral edges in ℤ-periodic media. J. Phys. A 2010, 43, 474022. [Google Scholar] [CrossRef] [Scilit]
- Korotyaev, E.; Saburova, N. Spectral band localization for Schrödinger operators on discrete periodic graphs. Proc. Amer. Math. Soc. 2015, 143, 3951–3967. [Google Scholar] [CrossRef] [Scilit]
- Lledó, F.; Post, O. Eigenvalue bracketing for discrete and metric graphs. J. Math. Anal. Appl. 2008, 348, 806–833. [Google Scholar] [CrossRef] [Scilit]
- Suzuki, A. Spectrum of the Laplacian on a covering graph with pendant edges I: The one-dimensional lattice and beyond. Linear Algebra Appl. 2013, 439, 3464–3489. [Google Scholar] [CrossRef] [Scilit]
- Aizenman, M.; Schenker, J. The creation of spectral gaps by graph decoration. Lett. Math. Phys. 2000, 53, 253–262. [Google Scholar]
- Kuchment, P. Quantum graphs: II. Some spectral properties of quantum and combinatorial graphs. J. Phys. A 2005, 38, 4887. [Google Scholar] [CrossRef] [Scilit]
- Son, Y.W.; Cohen, M.L.; Louie, S.G. Energy gaps in graphene nanoribbons. Phys. Rev. Lett. 2009, 97, 216803. [Google Scholar] [CrossRef] [Scilit]
- Zhang, Z.; Guo, W. Energy-gap modulation of BN ribbons by transverse electric fields: First-principles calculations. Phys. Rev. B 2008, 77, 075403. [Google Scholar] [CrossRef] [Scilit]
- Fabila-Carrasco, J.S.; Lledó, F.; Post, O. Spectral gaps and discrete magnetic Laplacians. Linear Algebra Appl. 2018, 547, 183–216. [Google Scholar] [CrossRef] [Scilit]
- Sunada, T. A discrete analogue of periodic magnetic Schrödinger operators. Contemp. Math. 1994, 173, 283–299. [Google Scholar]
- Sunada, T. Topological crystallography—With a view towards discrete geometric analysis. In Surveys and Tutorials in the Applied Mathematical Sciences; Springer: Tokyo, Japan, 2013; Volume 6. [Google Scholar]
- Sunada, T. Discrete geometric analysis. Proc. Symp. Pure Math. 2008, 77, 51–83. [Google Scholar]
- Korotyaev, E.; Saburova, N. Schrödinger operators on periodic discrete graphs. J. Math. Anal. Appl. 2014, 420, 576–611. [Google Scholar] [CrossRef] [Scilit]
- Higuchi, Y.; Shirai, T. A remark on the spectrum of magnetic Laplacian on a graph. Yokohama Math. J. 1999, 47, 129–141. [Google Scholar]
- Kobayashi, T.; Ono, K.; Sunada, T. Periodic Schrödinger operators on a manifold. Forum Math. 1989, 1, 69–79. [Google Scholar] [CrossRef] [Scilit]
- Chien, J.C. Polyacetylene: Chemistry, Physics, and Material Science; Academic Press: Orlando, FL, USA, 2012. [Google Scholar]
- Shirakawa, H. The discovery of polyacetylene film: The dawning of an era of conducting polymers (Nobel lecture). Angew. Chem. Int. Ed. 2001, 40, 2574–2580. [Google Scholar] [CrossRef] [Scilit]
- Ebisawa, F.; Kurokawa, T.; Nara, S. Electrical properties of polyacetylene/polysiloxane interface. J. Appl. Phys. 1983, 54, 3255–3259. [Google Scholar] [CrossRef] [Scilit]
- Fabila-Carrasco, J.S.; Lledó, F.; Post, O. Spectral ordering of discrete weighted graphs. In preparation.
- Santos, H.; Chico, L.; Brey, L. Carbon nanoelectronics: Unzipping tubes into graphene ribbons. Phys. Rev. Lett. 2009, 103, 086801. [Google Scholar] [CrossRef] [Scilit] [PubMed]
© 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).





