On Conway's potential function for colored links

preprint2014arXivOpen access

Abstract

The Conway potential function (CPF) for colored links is a convenient version of the multi-variable Alexander-Conway polynomial. We give a skein characterization of CPF, much simpler than the one by Murakami. In particular, Conway's `smoothing of crossings' is not in the axioms. The proof uses a reduction scheme in a twisted group-algebra PnBn\mathbb P_nB_n, where BnB_n is a braid group and Pn\mathbb P_n is a domain of multi-variable rational fractions. The proof does not use computer algebra tools. An interesting by-product is a characterization of the Alexander-Conway polynomial of knots.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.