Spanning tree generating functions and Mahler measures

DOI10.1088/1751-8113/45/49/494001MaRDI QIDQ4903598zbMATH OpenOpenAlexWikidataFDO

Authors Anthony J Guttmann, Mathew Rogers

Publication date 23 January 2013

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1207.2815

zbMATH Keywords

hypergeometric functionsLaurent polynomialsMahler measureslattice Green functionspanning tree generating function

Mathematics Subject Classification ID

Trees (05C05) Classical hypergeometric functions, ({}_2F_1) (33C05) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Stochastic methods applied to problems in equilibrium statistical mechanics (82B31)

Abstract: We define the notion of a spanning tree generating function (STGF) $sum{a}_n{z}^n$, which gives the spanning tree constant when evaluated at $z=1,$ and gives the lattice Green function (LGF) when differentiated. By making use of known results for logarithmic Mahler measures of certain Laurent polynomials, and proving new results, we express the STGFs as hypergeometric functions for all regular two and three dimensional lattices (and one higher-dimensional lattice). This gives closed form expressions for the spanning tree constants for all such lattices, which were previously largely unknown in all but one three-dimensional case. We show for all lattices that these can also be represented as Dirichlet $L$-series. Making the connection between spanning tree generating functions and lattice Green functions produces integral identities and hypergeometric connections, some of which appear to be new.

Recommendations

• Spanning trees on the Sierpinski gasket
• Spanning trees on lattices and integral identities
• Spanning tree generating functions for infinite periodic graphs L and connections with simple closed random walks on L
• Spanning trees of finite Sierpiński graphs
• On Rationality of Generating Function for the Number of Spanning Trees in Circulant Graphs
• Determinantal generating functions of colored spanning forests
• Asymptotic Enumeration of Spanning Trees
• On polynomials of spanning trees
• Spanning trees and a conjecture of Kontsevich
• Generating functions of embedded trees and lattice paths

Cited in

(16)

• Determinantal generating functions of colored spanning forests
• Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians
• Complexity of discrete Seifert foliations over a graph
• The hypergeometric series for the partition function of the 2D Ising model
• Spanning tree generating functions for infinite periodic graphs L and connections with simple closed random walks on L
• Weighted graphs, spanning tree generating functions and anisotropic lattice systems: illustrative results for the Ising and dimer models
• Torsion-weighted spanning acycle entropy in cubical lattices and Mahler measures
• Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics
• Complexity of the circulant foliation over a graph
• Analytic properties for the honeycomb lattice Green function at the origin
• Asymptotics and arithmetical properties of complexity for circulant graphs
• The number of rooted forests in circulant graphs
• The double hypergeometric series for the partition function of the 2D anisotropic Ising model
• Mahler/zeta correspondence
• The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
• Vertex-colored graphs, bicycle spaces and Mahler measure

This page was built for publication: Spanning tree generating functions and Mahler measures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903598)