Graph complexity and Mahler measure

Authors Daniel S. Silver, Susan G. Williams

Publication date 21 January 2017

Planar graphs; geometric and topological aspects of graph theory (05C10) Symbolic dynamics (37B10) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Abstract: The (torsion) complexity of a finite edge-weighted graph is defined to be the order of the torsion subgroup of the abelian group presented by its Laplacian matrix. When G is d-periodic (i.e., G has a free action of the rank-d free abelian group by graph automorphisms, with finite quotient) the Mahler measure of its Laplacian determinant polynomial is the growth rate of the complexity of finite quotients of G. Lehmer's question, an open question about the roots of monic integral polynomials, is equivalent to a question about the complexity growth of edge-weighted 1-periodic graphs.

This page was built for publication: Graph complexity and Mahler measure

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