arXiv subjects

Puttipong Pongtanapaisan

Publications and source records attributed to Puttipong Pongtanapaisan.

25 records · Page 2Linked to original sources

arXiv2022

Graphoids

We study invariants of virtual graphoids, which are virtual spatial graph diagrams with two distinguished degree-one vertices modulo graph Reidemeister moves applied away from the distinguished vertices. Generalizing previously known results, we give topological interpretations of graphoids. There are several applications to virtual graphoid theory. First, virtual graphoids are suitable objects for studying knotted graphs with open ends arising in proteins. Second, a virtual graphoid can be thought of as a way to represent a virtual spatial graph without using as many crossings, which can be advantageous for computing invariants.

math.CO↗

arXiv2022

Bounds for Kirby-Thompson invariants of knotted surfaces

We provide sharp lower bounds for two versions of the Kirby-Thompson invariants for knotted surfaces, one of which was originally defined by Blair, Campisi, Taylor, and Tomova. The second version introduced in this paper measures distances in the dual curve complex instead of the pants complex. We compute the exact values of both KT-invariants for infinitely many knotted surfaces with bridge number at most six.

math.GT↗

arXiv2021

Bounding the Kirby-Thompson invariant of spun knots

A bridge trisection of a smooth surface in $S^4$ is a decomposition analogous to a bridge splitting of a link in $S^3$. The Kirby-Thompson invariant of a bridge trisection measures its complexity in terms of distances between disc sets in the pants complex of the trisection surface. We give the first significant bounds for the Kirby-Thompson invariant of spun knots. In particular, we show that the Kirby-Thompson invariant of the spun trefoil is 15.

math.GT↗

arXiv2019

Wirtinger Numbers for Virtual Links

The Wirtinger number of a virtual link is the minimum number of generators of the link group over all meridional presentations in which every relation is an iterated Wirtinger relation arising in a diagram. We prove that the Wirtinger number of a virtual link equals its virtual bridge number. Since the Wirtinger number is algorithmically computable, it gives a more effective way to calculate an upper bound for the virtual bridge number from a virtual link diagram. As an application, we compute upper bounds for the virtual bridge numbers and the quandle counting invariants of virtual knots with 6 or fewer crossings. In particular, we found new examples of nontrivial virtual bridge number one knots, and by applying Satoh's Tube map to these knots we can obtain nontrivial weakly superslice links.

math.GT↗

arXiv2019

Critical Bridge Spheres for Links with Arbitrarily Many Bridges

We show that for every integer $b\geq 3$, there exists a link in a $b$-bridge position with respect to a critical bridge sphere. In fact, for each $b$, we construct an infinite family of links which we call square whose bridge spheres are critical.

math.GT↗

arXiv2019

Oriented Local Moves and Divisibility of the Jones Polynomial

For any virtual link $L = S \cup T$ that may be decomposed into a pair of oriented $n$-tangles $S$ and $T$, an oriented local move of type $T \mapsto T'$ is a replacement of $T$ with the $n$-tangle $T'$ in a way that preserves the orientation of $L$. After developing a general decomposition for the Jones polynomial of the virtual link $L = S \cup T$ in terms of various (modified) closures of $T$, we analyze the Jones polynomials of virtual links $L_1,L_2$ that differ via a local move of type $T \mapsto T'$. Succinct divisibility conditions on $V(L_1)-V(L_2)$ are derived for broad classes of local moves that include the $Δ$-move and the double-$Δ$-move as special cases. As a consequence of our divisibility result for the double-$Δ$-move, we introduce a necessary condition for any pair of classical knots to be $S$-equivalent.

math.GT↗

arXiv2015

Annular Non-Crossing Matchings

It is well known that the number of distinct non-crossing matchings of $n$ half-circles in the half-plane with endpoints on the x-axis equals the $n^{th}$ Catalan number $C_n$. This paper generalizes that notion of linear non-crossing matchings, as well as the circular non-crossings matchings of Goldbach and Tijdeman, to non-crossings matchings of $n$ line segments embedded within an annulus. We prove that the number of such matchings $\vert Ann(n,m) \vert$ with $n$ exterior endpoints and $m$ interior endpoints correspond to an entirely new, one-parameter generalization of the Catalan numbers with $C_n = \vert Ann(1,m) \vert$. We also develop bijections between specific classes of annular non-crossing matchings and other combinatorial objects such as binary combinatorial necklaces and planar graphs. Finally, we use Burnside's Lemma to obtain an explicit formula for $\vert Ann(n,m) \vert$ for all $n,m \geq 0$.

math.CO↗