activity
20052026
most citedPartial-twuality polynomials of delta-matroids

4 citations · 20 across the 32 of their papers we have counts for

collaborators
Showing math.GTShow all

7 papers · 1 filter

math.GT2021

Projectors in the Virtual Temperley-Lieb Algebra

Qingying Deng, Xian'an Jin, Louis H. Kauffman

We present a method of defining projectors in the virtual Temperley-Lieb algebra, that generalizes the Jones-Wenzl projectors in Temperley-Lieb algebra. We show that the projectors…

math.GT2020

On arrow polynomials of checkerboard colorable virtual links

Qingying Deng, Xian'an Jin, Louis H. Kauffman

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 apply…

math.GT2018

The generalized Yamada polynomials of virtual spatial graphs

Qingying Deng, Xian'an Jin, Louis H. Kauffman

Classical knot theory can be generalized to virtual knot theory and spatial graph theory. In 2007, Fleming and Mellor combined virtual knot theory and spatial graph theory to form,…

math.GT2017

Graphical virtual links and a polynomial of signed cyclic graphs

Qingying Deng, Xian'an Jin, Louis H Kauffman

For a signed cyclic graph G, we can construct a unique virtual link L by taking the medial construction and convert 4-valent vertices of the medial graph to crossings according to…

math.GT2017★ 2 cited

The Minimal Coloring Number Of Any Non-splittable -colorable Link Is Four

Meiqiao Zhang, Xian'an Jin, Qingying Deng

K. Ichihara and E. Matsudo introduced the notions of -colorable links and the minimal coloring number for -colorable links, which is one of invariants for l…

math.GT2015★ 3 cited

Minimal sufficient sets of colors and minimum number of colors

Jun Ge, Xian'an Jin, Louis H. Kauffman +2

In this paper we first investigate minimal sufficient sets of colors for p=11 and 13. For odd prime p and any p-colorable link L with non-zero determinant, we give alternative proo…

math.GT2014★ 1 cited

When will the crossing number of an alternating link decrease by two via a crossing change?

Xian'an Jin, Fuji Zhang, Jun Ge

Let be a reduced alternating diagram of a non-split link and be the link whose diagram is obtained from by a crossing change. If is alternating,…