Group Presentations for Links in Thickened Surfaces

Silver, Daniel S.; Williams, Susan G.

doi:10.48550/arxiv.2005.01576

Cited by 1 publication

(5 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There is a strong relationship between p-colorings of plane graphs and p-colorings of link diagrams [27,33]. We review the relationship in Section 3.…”

Section: Motivationmentioning

confidence: 99%

“…The condition at each crossing that corresponds to the Fox p-coloring condition appears in Figure 6. Details can be found in [32]. We will call such an assignment of colors to the regions a Dehn p-coloring of the diagram.…”

Section: Coloring and Complexity Of Finite Graphsmentioning

confidence: 99%

“…Uniqueness follows from the observation that if we determine the color of some unshaded region and then follow a simple closed path around a vertex, determining the colors of successive unshaded regions along the way, then when we return to the initial unshaded region, the Laplace relation forces us to arrive at the same color with which we began. (More details can be found in [32].) Finally, assign to each arc of D the sum of the colors of the regions on both sides.…”

Section: Coloring and Complexity Of Finite Graphsmentioning

confidence: 99%

“…and these definitions reduce to the ones in Section 2. Examples appear below; additional examples can be found in [16,32]. The reader should be aware that in graph theory literature the term "Laplacian polynomial" is often used for the characteristic polynomial of the integral Laplacian matrix.…”

Section: Periodic Graphs and Laplacian Modulesmentioning

confidence: 99%

“…Again we can color trivially, but nontrivial p-colorings can exist too. The set of the all p-colorings of the diagram is a vector space under arc-wise addition and scalar multiplication.There is a strong relationship between p-colorings of plane graphs and p-colorings of link diagrams [27,33]. We review the relationship in Section 3.…”

mentioning

confidence: 99%

See 4 more Smart Citations

Graph Complexity and Link Colorings

Silver¹,

Williams²

2020

Preprint

Self Cite

View full text Add to dashboard Cite

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 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. MSC: 05C10, 37B10, 57M25, 82B20 MotivationConsider a locally finite graph without multiple edges or isolated vertices. Let p be an odd prime. We can attempt to form a "p-coloring" of the graph, assigning elements ("colors") of Z/p to the vertices in such a way that the color of any vertex is the average of the colors of the adjacent vertices. Obviously, the graph can be colored trivially or "monochromatically," that is, with any single color. But nontrivial p-colorings might exist as well. It is clear that the set of all p-colorings of the graph is a vector space under vertex-wise addition and scalar multiplication. Now consider a plane diagram of a knot or link. (As a knot is a link with only one component, henceforth we will use the more general term.) We can try to form a "p-coloring," assigning colors to the arcs in such a way that the color of any overcrossing arc is the average of the colors of its two undercrossing arcs (see Section 4). Again we can color trivially, but nontrivial p-colorings can exist too. The set of the all p-colorings of the diagram is a vector space under arc-wise addition and scalar multiplication.There is a strong relationship between p-colorings of plane graphs and p-colorings of link diagrams [27,33]. We review the relationship in Section 3. By substituting the continuous palette T = R/Z, which contains Z/p as a subgroup, and replacing the plane with a compact orientable surface S, we enter the world of algebraic dynamical systems [28]. When S is an annulus, we obtain a version of Lehmer's unanswered question about roots of monic integral polynomials, which we formulate in terms of signed graphs. * Both authors are grateful for the support of the Simons Foundation.

show abstract

“…There is a strong relationship between p-colorings of plane graphs and p-colorings of link diagrams [27,33]. We review the relationship in Section 3.…”

Section: Motivationmentioning

confidence: 99%

Section: Coloring and Complexity Of Finite Graphsmentioning

confidence: 99%

Section: Coloring and Complexity Of Finite Graphsmentioning

confidence: 99%

Section: Periodic Graphs and Laplacian Modulesmentioning

confidence: 99%

mentioning

confidence: 99%

See 3 more Smart Citations