Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2605.01026

A HOMFLYPT-type invariant for pseudo links via a resolution in Hecke algebras

Ioannis Diamantis
View original source ↗Read source document ↗Export metadata ↓

Abstract

Pseudo links generalize classical links by allowing crossings with missing over/under information, called pre-crossings. While the pseudo braid framework provides an algebraic description of pseudo links via a Markov-type theorem, the construction of polynomial invariants using Hecke algebra techniques is obstructed by the presence of the pseudo Reidemeister 1 move. In this paper, we construct a HOMFLYPT-type invariant for oriented pseudo links via the pseudo Hecke algebra of type \(A\). The construction is based on a resolution homomorphism that maps each pseudo generator to a linear combination of a braid generator and its inverse, interpreting pre-crossings as algebraic superpositions of classical crossings. Composing this map with the Ocneanu trace and applying a suitable normalization yields an invariant satisfying a natural pseudo skein relation. We further show that the invariant admits a state-sum formulation as a weighted sum of classical HOMFLYPT-type invariants over all classical resolutions of the pseudo crossings, as well as a skein-theoretic characterization in terms of its values on classical links and the pseudo skein relation.

Explore related subjects

math.GTmath.QA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ioannis Diamantis. 2026-05-01. A HOMFLYPT-type invariant for pseudo links via a resolution in Hecke algebras. https://arxiv.org/abs/2605.01026

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗