Related papers: A note on dimers and T-graphs
We describe a new type of discrete symmetry that relates heterotic-string models. It is based on the spectral flow operator which normally acts within a general N=(2,2) model and we use this operator to construct a map between N=(2,0)…
The dimer model on a graph embedded in the torus can be interpreted as a collection of random self-avoiding loops. In this paper, we consider the uniform toroidal honeycomb dimer model. We prove that when the mesh of the graph tends to zero…
The dimer tiling problem asks in how many ways can the edges of a graph be covered by dimers so that each site is covered once. In the special case of a planar graph, this problem has a solution in terms of a free fermionic field theory. We…
Room temperature simulations of graphene have been performed as a function of the mechanical tension of the layer. Finite-size effects are accurately reproduced by an acoustic dispersion law for the out-of-plane vibrations that, in the…
In this paper we motivate some new directions of research regarding the lattice width of convex bodies. We show that convex bodies of sufficiently large width contain a unimodular copy of a standard simplex. This implies that every lattice…
Thermal fluctuations of single layer hydrogenated graphene (graphane) are investigated using large scale atomistic simulations. By analyzing the mean square value of the height fluctuations $<h^2>$ and the height-height correlation function…
We study two models of discrete height functions, that is, models of random integer-valued functions on the vertices of a tree. First, we consider the random homomorphism model, in which neighbours must have a height difference of exactly…
A directed graph, called an M-graph, is attached to every melody. Our chief concern in this paper is to investigate (1) how the positivity of the slope of the M-graph is related to singability of the melody, (2) when the M-graph has a…
In the present paper we establish a clear correspondence between probabilities of certain edges belonging to a realization of the uniform spanning tree (UST), and the states of a fermionic Gaussian free field. Namely, we express the…
Flow polytopes of acyclic oriented graphs arise naturally in combinatorial optimization, and the study of their volumes and triangulations has revealed intriguing connections across combinatorics, geometry, algebra, and representation…
Lattice studies of gauge theories with symplectic gauge groups provide valuable information about gauge dynamics, and complement the results of lattice investigations focused on unitary gauge groups. These theories play a central role in…
We consider fermionic fully-packed loop and quantum dimer models which serve as effective low-energy models for strongly correlated fermions on a checkerboard lattice at half and quarter filling, respectively. We identify a large number of…
We derive an explicit link between Gaussian Markov random fields on metric graphs and graphical models, and in particular show that a Markov random field restricted to the vertices of the graph is, under mild regularity conditions, a…
Covering a graph or a lattice with non-overlapping dimers is a problem that has received considerable interest in areas such as discrete mathematics, statistical physics, chemistry and materials science. Yet, the problem of percolation on…
We discuss the effect of elastic deformations on the electronic properties of bilayer graphene membranes. Distortions of the lattice translate into fictitious gauge fields in the electronic Dirac Hamiltonian which are explicitly derived…
A lattice model is presented for investigating the fluctuations in static granular materials under gravitationally induced stress. The model is similar in spirit to the scalar q-model of Coppersmith et al., but ensures balance of all…
New lattice model for the gradient elasticity is suggested. This lattice model gives a microstructural basis for second-order strain-gradient elasticity of continuum that is described by the linear elastic constitutive relation with the…
The treewidth of a graph is an important invariant in structural and algorithmic graph theory. This paper studies the treewidth of line graphs. We show that determining the treewidth of the line graph of a graph $G$ is equivalent to…
In this work we study a sequence of perfect t-embeddings of uniformly weighted Aztec diamonds. We show that these perfect t-embeddings can be used to prove convergence of gradients of height fluctuations to those of the Gaussian free field.…
We review a recent construction of the free field equations for totally symmetric tensors and tensor-spinors that exhibits the corresponding linearized geometry. These equations are not local for all spins >2, involve unconstrained fields…