Related papers: On the entropy of spanning trees on a large triang…
In this paper, we first concentrate on the possible values and dense property of entropies for isotropic and anisotropic axial products of subshifts of finite type (SFTs) on $\mathbb{N}^d$ and $d$-tree $\mathcal{T}_d$. We prove that the…
We discuss a recursive formula for number of spanning trees in a graph. The paper is written primary for school students.
The [dual] string tension of a spatial 't Hooft loop in the deconfined phase of Yang-Mills theory can be formulated as the tension of an interface separating different Z_N deconfined vacua. We review the 1-loop perturbative calculation of…
The entropy of entanglement between a three-dimensional slab of thickness l and its complement is studied numerically for four-dimensional SU(2) lattice gauge theory. We find a signature of a nonanalytic behavior of the entanglement…
We prove detailed asymptotics for the number of spanning trees, called complexity, for a general class of discrete tori as the parameters tend to infinity. The proof uses in particular certain ideas and techniques from an earlier paper. Our…
The definition of $k^{th}$-order empirical entropy of strings is extended to node labelled binary trees. A suitable binary encoding of tree straight-line programs (that have been used for grammar-based tree compression before) is shown to…
We explore the properties of magnetic excitations on the trellis lattice which is relevant for the so-called telephone-number compounds A$_{14}$Cu$_{24}$O$_{41}$ and the system SrCu$_2$O$_3$. The trellis lattice consists of two-leg ladders…
We calculate the internal energy of the Potts model on the triangular lattice with two- and three-body interactions at the transition point satisfying certain conditions for coupling constants. The method is a duality transformation.…
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 give a prescription for calculating the entanglement entropy in holographic probe brane systems by systematically taking the leading order backreaction of the probe brane into account. We find a simple compact double integral formula,…
In this paper, we develop a new method to produce explicit formulas for the number $\tau(n)$ of spanning trees in the undirected circulant graphs $C_{n}(s_1,s_2,\ldots,s_k)$ and $C_{2n}(s_1,s_2,\ldots,s_k,n).$ Also, we prove that in both…
A spanning tree of a graph $G$ is a connected acyclic spanning subgraph of $G$. We consider enumeration of spanning trees when $G$ is a $2$-tree, meaning that $G$ is obtained from one edge by iteratively adding a vertex whose neighborhood…
Using the method of spectral decimation and a modified version of Kirchhoffs Matrix-Tree Theorem, a closed form solution to the number of spanning trees on approximating graphs to a fully symmetric self-similar structure on a finitely…
By revisiting the Kirchhoff's Matrix-Tree Theorem, we give an exact formula for the number of spanning trees of a graph in terms of the quantum relative entropy between the maximally mixed state and another state specifically obtained from…
We show that the entanglement entropy and alpha entropies corresponding to spatial polygonal sets in $(2+1)$ dimensions contain a term which scales logarithmically with the cutoff. Its coefficient is a universal quantity consisting in a sum…
Using a mapping of compact polymers on the Manhattan lattice to spanning trees, we calculate exactly the average number of bends at infinite temperature. We then find, in a high temperature approximation, the energy of the system as a…
We study the entanglement entropy between the two outgoing particles in an elastic scattering process. It is formulated within an S-matrix formalism using the partial wave expansion of two-body states, which plays a significant role in our…
We present a detailed asymptotic analysis of correlation functions for the two component spanning tree on the two-dimensional lattice when one component contains three paths connecting vicinities of two fixed lattice sites at large distance…
In this paper we obtain precise asymptotics for certain families of graphs, namely circulant graphs and degenerating discrete tori. The asymptotics contain interesting constants from number theory among which some can be interpreted as…
We study Markov tree-shifts given by $k$ transition matrices, one for each of its $k$ directions. We provide a method to characterize the complexity function for these tree-shifts, used to calculate the tree entropies defined by Ban and…