Abstract
We introduce the alternating tangle decomposition of a diagram of a link L and improve the upper bound of arc index α(L) by using information of the alternating tangle decomposition. Also we get the exact arc index of a class of links by combining the upper bound with Morton and Beltrami's lower bound of the arc index.
Sign-in/Register to access full text options 
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 callSimilar Papers
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.
