Search arXivSearch

arXiv · 2512.22401

$U_q(\mathfrak{gl}(m|n))$ bounds on the minimal genus of virtual links

Abstract

For links $L \subset Σ\times [0,1]$, where $Σ$ is a closed orientable surface, we define a $U_q(\mathfrak{gl}(1|1))$ Reshetikhin-Turaev invariant with coefficients in $\mathbb{Z}[H_1(Σ)]$. This invariant turns out to be equivalent to an infinite cyclic version of the Carter-Silver-Williams (CSW) polynomial. The importance of the CSW polynomial is that half its symplectic rank gives strong lower bounds on the virtual genus. Recall that the virtual genus of a virtual link $J$ is the smallest genus of all closed orientable surfaces $Σ$ on which $J$ can be represented by a link diagram on $Σ$. Here we generalize the CSW lower bound to all quantum supergroups $U_q(\mathfrak{gl}(m|n))$ with $m,n>0$. For $(m,n)=(1,1)$, the $U_q(\mathfrak{gl}(m|n))$ bound is the same as the CSW bound. However, changing the value of the pair $(m,n)$ can give lower bounds better than those available from other known methods. We compare the $U_q(\mathfrak{gl}(m|n))$ lower bounds to those coming from the CSW polynomial, the surface bracket, the arrow polynomial, hyperbolicity, and the Gordon-Litherland determinant test. As a first application, we show that the Seifert genus of homologically trivial knots in thickened surfaces is not additive under the connected sum operation of virtual knots. As a second application, we prove that the Jaeger-Kauffman-Saleur invariant of a virtual knot is always realizable as the Alexander polynomial of an infinite cyclic cover of a knot complement in some $Σ\times [0,1]$, but is not always so on a surface of minimal genus. This is accomplished with a generalization of the $Zh$-construction, called the homotopy $Zh$-construction.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Micah Chrisman, Killian Davis, Anup Poudel. 2025-12-26. $U_q(\mathfrak{gl}(m|n))$ bounds on the minimal genus of virtual links. https://arxiv.org/abs/2512.22401

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT