2020
DOI: 10.48550/arxiv.2008.05665
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Graph Complexity and Link Colorings

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 Z 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 ∪ C with unknotted component C. In this case the Laplacian polynomial of G is related to the Alexander … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 27 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?