On Conway's potential function for colored links

From MaRDI portal
Publication:256402

DOI10.1007/S10114-015-4428-9zbMATH Open1337.57025arXiv1407.3081OpenAlexW2118015557MaRDI QIDQ256402FDOQ256402


Authors: Boju Jiang Edit this on Wikidata


Publication date: 9 March 2016

Published in: Acta Mathematica Sinica, English Series (Search for Journal in Brave)

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 mathbbPnBn, where Bn is a braid group and mathbbPn 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.


Full work available at URL: https://arxiv.org/abs/1407.3081




Recommendations




Cites Work


Cited In (11)





This page was built for publication: On Conway's potential function for colored links

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q256402)