arXiv · 2002.07361
On arrow polynomials of checkerboard colorable virtual links
Abstract
In this paper we give two new criteria of detecting the checkerboard colorability of virtual links by using odd writhe and arrow polynomial of virtual links, respectively. By applying new criteria, we prove that 6 virtual knots are not checkerboard colorable, leaving only one virtual knot whose checkerboard colorability is unknown among all virtual knots up to four classical crossings.
Explore related subjects
Keep this discovery
Qingying Deng, Xian'an Jin, Louis H. Kauffman. 2020-02-18. On arrow polynomials of checkerboard colorable virtual links. https://arxiv.org/abs/2002.07361
Cite the original work for its findings. Save a collection to share your selection of sources.