Quasi-alternating links and $Q$-polynomials
Masakazu Teragaito

TL;DR
This paper refines the relationship between the degree of the $Q$-polynomial and the determinant for quasi-alternating links, providing a more precise understanding of their algebraic properties.
Contribution
It offers a refined evaluation of the degree of the $Q$-polynomial in relation to the determinant for quasi-alternating links, extending previous results.
Findings
Degree of $Q$-polynomial is less than the determinant for quasi-alternating links
Provides a more precise bound or evaluation for the degree of $Q$-polynomial
Enhances understanding of algebraic invariants of quasi-alternating links
Abstract
Qazaqzeh and Chbili showed that for any quasi-alternating link, the degree of -polynomial is less than its determinant. We give a refinement of their evaluation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Advanced Combinatorial Mathematics · Advanced Algebra and Geometry
