Abstract

The Tait conjecture states that reduced alternating diagrams of links in [Formula: see text] have the minimal number of crossings. It has been proved in 1987 by M. Thistlethwaite, L. H. Kauffman and K. Murasugi studying the Jones polynomial. In this paper, we prove an analogous result for alternating links in [Formula: see text] giving a complete answer to this problem. In [Formula: see text] we find a dichotomy: the appropriate version of the statement is true for [Formula: see text]-homologically trivial links, and our proof also uses the Jones polynomial. On the other hand, the statement is false for [Formula: see text]-homologically non-trivial links, for which the Jones polynomial vanishes.

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 call

Disclaimer: 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.