摘要

We introduce an additional arrow structure on ribbon graphs. We extend the dichromatic polynomial to ribbon graphs with this structure. This extended polynomial satisfies the contraction-deletion relations and behaves naturally with respect to the partial duality of ribbon graphs. From a virtual link, we construct an arrow ribbon graph whose extended dichromatic polynomial specializes to the arrow polynomial of the virtual link recently introduced by H. Dye and L. Kauffman. This result generalizes the classical Thistlethwaite theorem to the arrow polynomial of virtual links.

  • 出版日期2012-11