arXiv · 2505.05688
Geometric bounds for spanning tree entropy of planar lattice graphs
Abstract
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 polyhedra and hyperbolic regular ideal bipyramids. For many planar lattice graphs, we show these bounds are easy to compute and provide excellent numerical estimates for the spanning tree entropy.
Explore related subjects
Keep this discovery
Abhijit Champanerkar, Ilya Kofman. 2025-05-08. Geometric bounds for spanning tree entropy of planar lattice graphs. https://arxiv.org/abs/2505.05688
Cite the original work for its findings. Save a collection to share your selection of sources.