English

The replacements of signed graphs and Kauffman brackets of links

Combinatorics 2007-05-23 v1 Geometric Topology

Abstract

Let GG be a signed graph. Let G^\hat{G} be the graph obtained from GG by replacing each edge ee by a chain or a sheaf. We first establish a relation between the QQ-polynomial of G^\hat{G}[6] and the WW-polynomial of GG [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 QQ-polynomial of signed plane graph and the Kauffman bracket of link diagram, we can compute the Kauffman bracket of link diagram corresponding to G^\hat{G} by means of the WW-polynomial of GG. 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.

Keywords

Cite

@article{arxiv.math/0511326,
  title  = {The replacements of signed graphs and Kauffman brackets of links},
  author = {Xian'an Jin and Fuji Zhang},
  journal= {arXiv preprint arXiv:math/0511326},
  year   = {2007}
}

Comments

18 pages, 7 figures