Abstract
For coprime integers [Formula: see text] and [Formula: see text], the [Formula: see text]-cable [Formula: see text]-polynomial of a knot is the [Formula: see text]-polynomial of the [Formula: see text]-cable knot of the knot, where the [Formula: see text]-polynomial is the common zeroth coefficient polynomial of the HOMFLYPT and Kauffman polynomials. Since it is known that the [Formula: see text]-polynomial is computable in polynomial time, the [Formula: see text]-cable [Formula: see text]-polynomial is also computable in polynomial time. In this paper, we show that the [Formula: see text]-cable [Formula: see text]-polynomial completely classifies the unoriented knots up to ten crossings including the chirality information.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
