Graph Complexity and Link Colorings

MaRDI QIDQ6347005zbMATH OpenFDO

Authors Daniel S. Silver, Susan G. Williams

Publication date 12 August 2020

Mathematics Subject Classification ID

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 signed 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 ${mathbbZ}^d$-action by graph automorphisms with finite quotient) the Mahler measure of its Laplacian polynomial is the growth rate of the complexity of finite quotients of $G$. Any 1-periodic plane graph $G$ determines a link $ellcupC$ with unknotted component $C$. In this case the Laplacian polynomial of $G$ is related to the Alexander polynomial of the link. Lehmer's question, an open question about the roots of monic integral polynomials, is equivalent to a question about the complexity growth of signed 1-periodic graphs that are not necessarily embedded.

This page was built for publication: Graph Complexity and Link Colorings

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