Dimer geometry, amoebae and a vortex dimer model
Abstract
We present a geometrical approach and introduce a connection for dimer problems on bipartite and nonbipartite graphs. In the bipartite case the connection is flat but has nontrivial holonomy round certain curves. This holonomy has the universality property that it does not change as the number of vertices in the fundamental domain of the graph is increased. It is argued that the Ktheory of the torus, with or without punctures, is the appropriate underlying invariant. In the nonbipartite case the connection has nonzero curvature as well as nonzero Chern number. The curvature does not require the introduction of a magnetic field. The phase diagram of these models is captured by what is known as an amoeba. We introduce a dimer model with negative edge weights which correspond to vortices. The amoebae for various models are studied with particular emphasis on the case of negative edge weights. Vortices give rise to new kinds of amoebae with certain singular structures which we investigate. On the amoeba of the vortex full hexagonal lattice we find the partition function corresponds to that of a massless Dirac doublet.
pacs:
05.50.+q,64.60.Cn,64.60.F,11.25.wI Introduction
The subject of dimers has a large literature and has attracted the interest of both mathematicians and physicists. A few useful mathematical and physical sources are OkounkovKenyonSheffield (); OkounkovKenyon2006 (); CimasoniReshetikhin_I (); CimasoniReshetikhin_II (); Broomhead:2012 () and Kasteleyn:1963 (); Fisher:1966 (); Nagle1989 (); HananyKennaway:2005 (); Francoetal:2006 (); HananyKennaway:2005 (); Fengetal:2008 (); OkounkovReshetikhinVafa:2006 (); Dijgraaf:2009 () respectively, as well as references therein.
Dimer partition functions can be expressed as a sum of Pfaffians of a Kasteleyn matrix, , which is a signed weighted adjacency matrix. The dimer partition function, with uniform weights, counts the number of perfect matchings of a graph. The model is naturally considered with positive weights and can have a nontrivial phase diagram as the weights are altered. In particular, it has a gapless phase which is described by the amoeba of a certain curve known as the spectral curve OkounkovKenyonSheffield (); OkounkovKenyon2006 () (see section III). The Kasteleyn matrix can be thought of as a discrete lattice Dirac operator CimasoniReshetikhin_I (); CimasoniReshetikhin_II (); Nash_OConnor_jphysa:2009 () and the finite size corrections to the partition function in the scaling limit coincide with that of a continuum Dirac–Fermion on a torus Nash_OConnor_jphysa:2009 (). If one further adds signs to the weights the model describes a lattice Dirac operator in a fixed gauge field background. The presence of additional signs we refer to as the presence of vortices in the dimer system.
We review the basic construction of dimer models and give a detailed construction of the connection on the determinant line bundle over the positive frequency eigenvector space of the Kasteleyn matrix. We find that

In the bipartite case the determinant line bundle has a flat connection.

The flat connection has nontrivial holonomy in accordance with the theory of the torus.

When vortices are included the system can describe additional massless Fermions and we present an example where the partition function, in the vortex full case of a hexagonal lattice, corresponds to a massless Dirac Fermion doublet.

For certain vortex configurations, the domain where the system describes a massless Dirac operator, the amoeba can develop a pinch.

The presence of vortices alters the thermodynamic phases, we exhibit a case where the gapped phase—an island, or compact oval in the amoeba corresponding to a massive Dirac phase—can, on introduction of vortices, shrink and even disappear.
The paper is organised as follows: section II describes basic results on dimers and dimer partition functions, focusing on bipartite dimer models. Sections III and IV describe a mathematical object known as an amoebae which describes the gapless parameter domain of the Kasteleyn matrix . In section V we construct the vector bundle of positive eigenvalues of , and show that its determinant line bundle has a flat connection and in section VI we show that this connection has nontrivial holonomy in accordance with the theory of the punctured torus. Section VII treats dimers on nonbipartite graphs. Section VIII is devoted to dimer models in to the presence of vortices. In section IX we present our conclusions; this is followed by an appendix on some of the relevant Ktheory.
Ii Dimers
Dimer models are concerned with the set of vertex matchings of a graph, or lattice, . We shall consider to be a bipartite or nonbipartite lattice with sites, or vertices, on the two torus . A perfect matching, , on is a disjoint collection of edges that contains all the vertices: for to exist must have an even number of vertices. An edge belonging to a matching is called a dimer and perfect matchings are the same thing as dimer configurations.
We denote the set of dimer configurations on by . Then to each matching, , we assign a weight ; is normally required to be real in which case all weights are positive. We will find it useful to go beyond this restriction in the latter part of this paper and consider signed weights, but for the moment we take all weights to be positive.
Given this data the dimer partition function is given by:
(1) 
Each matching, , consists of dimers with positive edge weights, whose relation to is that where are the edges of the matching , and is the weight associated with the edge , then
(2) 
yielding
(3) 
More generally one can consider dimers: i.e. matched edges where is less than or equal to the total number of edges; when one has a dimer model, otherwise one has a monomerdimer system. Monomerdimer systems have not yet yielded to exact solution methods.
An alternative generalisation is to consider some of the weights being negative, we will refer to such a system as containing vortices. It is relatively straightforward to solve for the partition function of such systems and as we shall see they have a rich physics. We shall only concern ourselves with dimer models, and dimer models with vortices, in this paper.
One can also investigate the probability of one, two, or more dimers (or edges), belonging to a matching : to do this one uses, the characteristic function of an edge , and the dimerdimer correlation functions : their joint definitions are that
(4)  
For a planar region in , and a graph with vertices, Kasteleyn Kasteleyn:1963 () showed that
(5) 
where is the Pfaffian of the Kasteleyn matrix which is a signed, antisymmetric, weighted adjacency matrix for : Kasteleyn’s sign assignments in are precisely what is needed to convert into the sum of positive terms that constitute the partition function .
We specialise, for the moment, to the case where is bipartite, so that we can colour vertices black and the other white. This allows us to write in the form
(6) 
with an real matrix (we write rather than since, later on, we want to use to denote a connection) and denotes transpose; note, too, that .
Let and be vector spaces generated by the sets of black and white vertices respectively, then is the linear map
(7) 
defined by
(8) 
where is the sign associated to the edge whose weight is .
The signs are computed by the clockwise odd rule Fisher:1966 (): arrows are placed on the edges and when following an arrow and when opposing one, and the product of the signs associated with any fundamental plaquette is when the plaquette is circulated in an anticlockwise direction; such an assignment of signs is called a Kasteleyn orientation.
Note that all closed paths on bipartite graphs have an even number of edges: thus clockwise odd is also anticlockwise odd. This is false for nonbipartite graphs which, when Kasteleyn oriented, possess an orientation which can be detected—cf. below where we discuss Chern numbers.
The general result CimasoniReshetikhin_I (); CimasoniReshetikhin_II () for a graph embedded in a closed oriented surface of genus , is that the partition function of the dimer model on is given by
where denotes the set of equivalence classes of the spin structures on , is the Arfinvariant of the spin structure labeled by , and is the Kasteleyn matrix with these boundary conditions.
When the graph is on a torus , the weighted sum is over the four different Kasteleyn matrices corresponding to the four choices of periodic and antiperiodic boundary conditions around the cycles of the torus and
(9) 
Each term in the sum corresponds to one of the discrete spin structures of on and, writing , one has
(10) 
Note that since is on a torus it is doubly periodic and can be realised as a quotient: one has
(11) 
where is the graph in the plane consisting of all possible translations by elements of of an appropriate fundamental domain contained in . However, itself may be multiple copies of this fundamental domain where the weights are repeated as translates. Then, by Fourier transforming we obtain a matrix with offdiagonal block .
On the torus corresponding to the translates of a fundamental tile, the spin structure decomposition for the partition function is given by^{1}^{1}1The overall sign ensures that the partition function is positive and is induced by the relation of to . Both the sign and the leading expression here, in terms of Pfaffians, are valid for both bipartite and nonbipartite graphs.
(12)  
The determinant of results in a polynomial with
(13) 
A key property of the polynomial is that it has a pair of zeros , related by complex conjugation.
We now describe the construction of . Let us label an arbitrary translated copy of the fundamental domain from which is built by with . Here denotes the number of horizontal translations to the right, and the number of translations to the left, the integer labels vertical translations in a similar way; the fundamental domain is .
Thus one has
(14) 
Now to each we associate the matrix ; so that, if denotes the signed weight of an edge joining vertex to , then we define
(15) 
With this data the fundamental domain containing the basic graph is and we define by writing
(16) 
so that then is a Laurent polynomial in and with real coefficients.
Note that if we defined using a domain other than the fundamental domain, e.g. if we wrote then would just be multiplied by a monomial in and and the formula for the partition function would still hold true.
Now both the infinite graph , and its bipartite blackwhite assignment, are translation invariant, and the decomposition
(17) 
can be viewed as an indexing of by the characters of the translation group ; in other words is simply the Fourier transform of the Kasteleyn matrix of .
A pair of examples illustrating the above process can be quite simply given: consider to be the graphs tiled by the fundamental domains of figure 1.
Then, for the hexagonal graph, we readily calculate that
(18)  
while for the rectangular one we have
(19)  
Observe that varying the dimer weights and in (18) is equivalent to moving and off the unit torus. In general, for any polynomial arising from a bipartite dimer construction, one can always absorb combinations of dimer weights into and to move them off the unit torus.
Iii Amoebae
Let with be a polynomial, then its zero locus
(20)  
is a curve in . The image of in under the logarithmic map defined by
(21)  
is known as the amoeba of so that .
The polynomial above is a special case of such an having real coefficients and is central to much of what follows; its zero locus is known as the spectral curve of the graph .
The amoebae for the two graphs of figure 1 are displayed in figure 2; the closed curve in figure 2 (b) is called a compact oval—we have moved off the unit torus and used weights , , for figure 2 (a); and for example , , with and all remaining weights unity for figure 2 (b).
Although an amoeba is unbounded in it has finite area; in fact its area is bounded above by an irrational multiple of the area of the Newton polygon of —the Newton polygon being the convex hull of the (integer) points for which . More precisely one has
(22) 
After multiplication of by a suitable monomial to eliminate its negative powers, one obtains a polynomial of degree , say. Since has real coefficients, it determines the real homogeneous polynomial in —where now —and thus a real algebraic curve in , this being natural geometrical data possessed by the spectral curve . We denote this real algebraic curve by . When plotting the amoeba the signs of and play an essential role in determining all its components which, in turn, constitute the amoeba boundary.
For dimer models on bipartite graphs is a Harnack curve. Harnack curves are very special curves possessing the maximal number of components: i.e. . The integer is the genus of the curve and is equal to the number of compact ovals of the amoeba.
It will be convenient for us to abuse terminology slightly and often refer to a curve (rather than ) as being Harnack, the context should prevent any confusion.
A fundamental result of Kenyon, Okounkov, and Sheffield OkounkovKenyonSheffield () and Kenyon and Okounkov OkounkovKenyon2006 () is that every Harnack curve arises in this way so that the correspondence between the spectral curves of periodic hexagonal dimer models and Harnack curves is a bijection. Also all bipartite planar graphs can be realised inside a large enough hexagonal lattice by a combination of setting some dimer edge weights to zero and bond contraction Fisher:1966 (); OkounkovKenyon2006 (); thus no bipartite graph is excluded. In addition, the most general hexagonal dimer model yields a generic Harnack curve of genus .
Positive rescaling of and gives a free action of on the set of Harnack curves; if one quotients by this action one obtains what is called in OkounkovKenyon2006 () the moduli space of Harnack curves. Amoebae provide natural coordinates for this moduli space: these coordinates being the areas of the holes and the distances between the tentacles OkounkovKenyon2006 ().
When a curve is Harnack the area of its amoeba is maximal and saturates the area inequality above—i.e.
(23) 
for Harnack.
The converse of this equality also holds in the sense that implies that the curve of (after possible rescaling of , and by complex constants) is invariant under complex conjugation and possesses a real part which determines a Harnack curve in —cf. Mikhalkin_Rullgard2001 () for more details.
Since the polynomial has real coefficients, the map is generically, at least to ; however when is Harnack is to everywhere, except at real nodes which occur on the boundary of , cf. OkounkovKenyon2006 (),Mikhalkin_Rullgard2001 (). In addition has exactly two zeroes, and , on the unit torus .
Iv Phases and amoebae
The amoeba can be viewed as the massless or gapless phase with its bounding curves as the phase boundaries in a dimer model phase diagram OkounkovKenyonSheffield (): the complement of the amoeba consists of both compact and noncompact regions. In the terminology of dimer models, as models of melting crystals, the noncompact regions exterior to the bounding ovals constitute the frozen regions. The amoeba itself is referred to as the liquid phase, and the interior of the compact ovals as the gaseous phase. There are also useful applications of these ideas to the Kitaev model Nash:2009prl () and topological phase transitions Nash_OConnor_jphysa:2009 ().
These different phases arise naturally when one calculates the correlation functions between the edges of . The correlation functions possess three types of decay OkounkovKenyonSheffield ()—where a decay is measured by the fall off of with distance between and —these types being exponential, polynomial, or no decay, and they correspond to the gaseous, liquid and frozen phases respectively. In the context of Kasteleyn matrices as Dirac operators, the amoeba is the massless phase while the interiors of the compact ovals correspond to massive Dirac operators Nash_OConnor_jphysa:2009 ().
V Dimer connections and curvatures
Now let once again denote coordinates on , rather than on , and let be a bipartite graph on whose Kasteleyn matrix , when Fourier transformed, gives where
(24) 
With these conventions the matrix is Hermitian. Here we use for the number of vertices in the fundamental tile, in contrast to the usage in the introduction where referred to the total number of vertices in the graph .
If is nonbipartite its Kasteleyn matrix also has a Fourier transformed component of the form
(25) 
with at least one of the diagonal blocks and being nonzero and such that is still Hermitian.
We now describe how to use this data to construct a certain connection on . The dimensional space of eigenvectors of with positive eigenvalues form a rank bundle over which we denote by .
Let , then the fibre , at , has a basis consisting of the corresponding positive eigenvectors which we denote by
(26) 
With respect to the standard complex inner product, fixed as varies, let each eigenvector have unit norm and, in an orthonormal basis, have components . When taken together the form the nonsquare matrix where
(27) 
giving one a map
(28) 
As varies the map embeds the fibres of —and thus the whole bundle—in the trivial bundle ; conversely, if is the adjoint of , the map is an orthogonal projection from to on which rests the nontriviality of .
Summarising, and abbreviating and by and respectively, yields
(29) 
where denotes the identity matrix on and ; is called a partial isometry—it is not a real isometry since is not a square matrix.
A section of is then a map taking values in —i.e. one has
(30) 
However, as usual, derivatives of such as may not, as varies, still be valued, but we can project them back onto to take care of this problem thereby creating a covariant derivative on . Thus the covariant derivative of is where
(31) 
Our choice of inner product above means that is the covariant derivative corresponding to a connection , say, which we can identify by direct calculation as follows: if is a map
(32) 
then the product gives us the section
(33) 
and the covariant derivative formula gives
(34)  
Hence the connection is the matrix where
(35) 
and its curvature is
(36) 
So the covariant derivative and curvature on are and respectively, with . A routine calculation shows that
(37) 
We shall examine the connection and its curvature in the subsequent sections but note that its introduction has not required the presence of a magnetic field.
Vi Holonomy and Flat connections
We will be interested in the connection associated with as it is this that gives the first Chern class of the connection. It turns out that for bipartite graphs the curvature is zero so that the associated connection is flat: nevertheless this connection is nontrivial as it has nontrivial holonomy as we shall now show.
It is instructive to first study a case where and we do this for the graph shown in figure 3. For the bipartite case, when , one punctures the torus at the points and since vanishes there, we denote the punctured torus by . One finds that the connection and its curvature are given by
(38)  
so that we have a flat connection; however the connection is not trivial as it has nontrivial holonomy for some curves on . In other words for such curves
(39)  
As an example, for figure 3 choose so that
(40) 
and thus at the points
(41) 
One then immediately discovers by direct calculation that if is a small circle
(42) 
Hence we obtain nontrivial holonomy and it is easy to choose a different and obtain other results: indeed if does not contain or , but is noncontractible because it is a nontrivial homology cycle, then can also have nontrivial holonomy.
For example if is the curve , constant, then
(43) 
Nontrivial flat connections require to have a non vanishing fundamental group but one knows that is homotopic to a bouquet of three circles (meaning three circles sharing one common point) and therefore
(44) 
so all is satisfactory.
These properties of flatness and nontrivial holonomy persist—for the appropriate curvature and connection—when the bipartite graph is enlarged as we now demonstrate.
First let be the curvature coming from the Kasteleyn matrix for a general bipartite graph. One has
(45) 
with curvature then it is easy to see that
(46) 
For, abbreviating to , and setting , can be written^{2}^{2}2For a (necessarily real) eigenvalue of with , and the column vector , we find that Now dividing our first displayed equation by , we deduce that, if , then so that , whence as given in 47 is the desired projection onto the positive eigenspace; also satisfies . as
(47) 
with the identity matrix. Hence
(48)  
and so we have,
(49)  
as claimed.
Now, just as when , there is nontrivial holonomy when : we shall also find the interesting result that the holonomy obtained is universal and is independent of .
However first we must identify an appropriate line bundle with connection and to this end we shall use the following notation: we denote the connection and curvature on any bundle by and respectively.
So taking our bundle —whose connection and curvature were formerly denoted by and above—we now denote these quantities by
(50) 
and respectively. As we will see below, the line bundle that we seek is simply the determinant line bundle of , that is
(51) 
Let denote the unit normalised positive eigenvectors of , then this bundle has projection where
(52)  
and the associated connection is therefore where
(53)  
Here it may be useful to recall that, if is a vector space, the inner product on , which for orthonormal renders the vectors orthonormal, is given by
(54)  
In fact,
(55) 
To see this note first that
(56)  
and for we observe that is a column vector and is a row vector with
(57)  
where and the projection is given by . Hence
(58) 
yielding
(59) 
as claimed.
One can check that is indeed a connection; it is also flat since its curvature satisfies
(60)  
Now we are ready to calculate the holonomy of round some curve : let
(61) 
and satisfy
(62) 
then is a unit norm eigenvector of with eigenvalue where
(63) 
Using this orthogonal decomposition for each we calculate that
(64)  