The replacements of signed graphs and Kauffman brackets of links
Xian'an Jin, Fuji Zhang
Abstract
Let G be a signed graph. Let G be the graph obtained from G by replacing each edge e by a chain or a sheaf. We first establish a relation between the Q-polynomial of G[6] and the W-polynomial of G [9]. Two special dual cases are derived from the relation, one of which has been studied in [8]. Based on the one to one correspondence between signed plane graphs and link diagrams, and the correspondence between the Q-polynomial of signed plane graph and the Kauffman bracket of link diagram, we can compute the Kauffman bracket of link diagram corresponding to G by means of the W-polynomial of G. By this way we use transfer matrix approach to compute the Kauffman bracket of rational links, and obtain their closed-form formulae. Finally we provide an example to point out that the relation we built can be used to deal with a wide type of link family.
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.