CWR sequence of invariants of alternating links and its properties
Michal Jablonowski

TL;DR
The paper introduces the CWR invariant, a new polynomial-based invariant for alternating links that generalizes previous invariants and offers stronger distinguishing power, supported by recursive relations and formulas derived from graph theory.
Contribution
It presents the CWR invariant, extending the WRP invariant with enhanced strength and explicit formulas, along with recursive skein relations for alternating links.
Findings
CWR invariant is stronger than WRP, HOMFLYPT, and Kauffman polynomials.
Derived recursive skein relations for the CWR invariant.
Provided explicit formulas using weighted adjacency matrices of Tait graphs.
Abstract
We present the invariant, a new invariant for alternating links, which builds upon and generalizes the invariant. The invariant is an array of two-variable polynomials that provides a stronger invariant compared to the invariant. We compare the strength of our invariant with the classical HOMFLYPT, Kauffman -variable, and Kauffman -variable polynomials on specific knot examples. Additionally, we derive general recursive "skein" relations, and also specific formulas for the initial components of the invariant using weighted adjacency matrices of modified Tait graphs.
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
TopicsCoding theory and cryptography · graph theory and CDMA systems
