Related papers: A Lattice Spanning-Tree Entropy Function
We prove infinitely many cases of conjectured sharp upper and lower bounds for the spanning tree entropy of any planar lattice graph. These bounds come from volumes of associated hyperbolic alternating links, right-angled hyperbolic…
Lattice Green functions appear in lattice gauge theories, in lattice models of statistical physics and in random walks. Here, space coordinates are treated as parameters and series expansions in the mass are obtained. The singular points in…
Let G be a finite graph or an infinite graph on which Z^d acts with finite fundamental domain. If G is finite, let T be a random spanning tree chosen uniformly from all spanning trees of G; if G is infinite, known methods show that this…
In this note we present the Green's functions and density of states for the most frequently encountered 2D lattices: square, triangular, honeycomb, kagome, and Lieb lattice. Though the results are well know, we hope that their derivation…
The problem of enumerating spanning trees on graphs and lattices is considered. We obtain bounds on the number of spanning trees $N_{ST}$ and establish inequalities relating the numbers of spanning trees of different graphs or lattices. A…
A `forward walking' Green's Function Monte Carlo algorithm is used to obtain expectation values for SU(3) lattice Yang-Mills theory in (3+1) dimensions. The ground state energy and Wilson loops are calculated, and the finite-size scaling…
We consider the spin k/2 analogue of the XXZ quantum spin chain. We compute the entanglement entropy S associated with splitting the infinite chain into two semi-infinite pieces. In the scaling limit, we find S ~ c_k/6 (ln(xi))+ln(g)+... .…
The notion of tree-shifts constitutes an intermediate class in between one-sided shift spaces and multidimensional ones. This paper proposes an algorithm for computing of the entropy of a tree-shift of finite type. Meanwhile, the entropy of…
We show how to use the lattice Green function to calculate capacitances in two dimensions with boundary conditions at infinity. It is shown how to calculate coefficients of capacitance and induction from the lattice Green function. A…
Spanning trees are an important quantity characterizing the reliability of a network, however, explicitly determining the number of spanning trees in networks is a theoretical challenge. In this paper, we study the number of spanning trees…
The logarithm of the number of Eulerian orientations, normalised by the number of vertices, is known as the residual entropy in studies of ice-type models on graphs. The spanning tree entropy depends similarly on the number of spanning…
Shrock and Wu have given numerical values for the exponential growth rate of the number of spanning trees in Euclidean lattices. We give a new technique for numerical evaluation that gives much more precise values, together with rigorous…
We establish upper and lower bounds for the metric entropy and bracketing entropy of the class of $d$-dimensional bounded monotonic functions under $L^p$ norms. It is interesting to see that both the metric entropy and bracketing entropy…
We perform a tree-level O(a) improvement of two-dimensional N=(2,2) supersymmetric Yang-Mills theory on the lattice, motivated by the fast convergence in numerical simulations. The improvement respects an exact supersymmetry Q which is…
We present two unconventional methods of extracting information from hadronic 2-point functions produced by Monte Carlo simulations. The first is an extension of earlier work by Leinweber which combines a QCD Sum Rule approach with lattice…
Efficient computation of lattice defect geometries such as point defects, dislocations, disconnections, grain boundaries, interfaces and free surfaces requires accurate coupling of displacements near the defect to the long-range elastic…
Triangulations are important objects of study in combinatorics, finite element simulations and quantum gravity, where its entropy is crucial for many physical properties. Due to their inherent complex topological structure even the number…
For $n$-vertex, $d$-dimensional lattices $\Lambda$ with $d \ge 2$, the number of spanning trees $N_{ST}(\Lambda)$ grows asymptotically as $\exp(n z_\Lambda)$ in the thermodynamic limit. We present an exact closed-form result for the…
We express the partition functions of the spanning tree on finite square lattices under five different sets of boundary conditions (free, cylindrical, toroidal, M\"obius strip, and Klein bottle) in terms of a principal partition function…
We introduce a generalization of relative entropy derived from the Wigner-Yanase-Dyson entropy and give a simple, self-contained proof that it is convex. Moreover, special cases yield the joint convexity of relative entropy, and for the map…