Coloring link diagrams by Alexander quandles

From MaRDI portal
Publication:2909495

DOI10.1142/S0218216512500940zbMATH Open1253.57004arXiv1105.3695MaRDI QIDQ2909495FDOQ2909495


Authors: Yongju Bae Edit this on Wikidata


Publication date: 30 August 2012

Published in: Journal of Knot Theory and its Ramifications (Search for Journal in Brave)

Abstract: In this paper, we study the colorability of link diagrams by the Alexander quandles. We show that if the reduced Alexander polynomial DeltaL(t) is vanishing, then L admits a non-trivial coloring by any non-trivial Alexander quandle Q, and that if DeltaL(t)=1, then L admits only the trivial coloring by any Alexander quandle Q, also show that if DeltaL(t)ot=0,1, then L admits a non-trivial coloring by the Alexander quandle Lambda/(DeltaL(t)).


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




Recommendations




Cites Work


Cited In (10)

Uses Software





This page was built for publication: Coloring link diagrams by Alexander quandles

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