High-Precision Entropy Values for Spanning Trees in Lattices
classification
🧮 math-ph
math.COmath.MP
keywords
valueslatticesnumericalspanningtreesaccuracyboundsentropy
read the original abstract
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 bounds on the accuracy. In particular, the new values resolve one of their questions.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.