Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 92 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 32 tok/s
GPT-5 High 40 tok/s Pro
GPT-4o 83 tok/s
GPT OSS 120B 467 tok/s Pro
Kimi K2 197 tok/s Pro
2000 character limit reached

Extending Quasi-alternating Links II (2506.16999v1)

Published 20 Jun 2025 in math.GT

Abstract: Champanerkar and Kofman [1] introduced an innovative method for constructing quasi-alternating links by substituting a quasi-alternating crossing c in a quasi-alternating link with a rational tangle of the same type. This construction was later extended by Chbili and Kaur [2] for any alternating tangle of same type. However, this approach does not generally apply to non-alternating tangles or alternating tangles of opposite types, although there are examples where it holds for alternating tangles of opposite type and certain non-alternating tangles. This raises a natural question to find the conditions and specific tangles for which this approach is applicable. In this paper, we explore this question by identifying several conditions under which this construction of new quasi-alternating links can still be valid for alternating tangles of opposite types. Additionally, we establish specific families of non-alternating tangles for which this construction is effective in creating new quasi-alternating links.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.