English
Related papers

Related papers: Computing Ribbon Obstructions for Colored Knots

200 papers

The colored Jones polynomial is a knot invariant that plays a central role in low dimensional topology. We give a simple and an efficient algorithm to compute the colored Jones polynomial of any knot. Our algorithm utilizes the walks along…

Quantum Algebra · Mathematics 2018-05-04 Mustafa Hajij , Jesse Levitt

We prove that any $11$-colorable knot is presented by an $11$-colored diagram where exactly five colors of eleven are assigned to the arcs. The number five is the minimum for all non-trivially $11$-colored diagrams of the knot. We also…

Geometric Topology · Mathematics 2015-05-13 Takuji Nakamura , Yasutaka Nakanishi , Shin Satoh

We characterize the possible reductions of $j$-invariants of elliptic curves which admit complex multiplication by an order $\mathcal{O}$ where the curve itself is defined over $\mathbb{Z}_p$. In particular, we show that the distribution of…

Number Theory · Mathematics 2017-04-06 Andrew Fiori

We study the deformations of a curve $C$ on an Enriques-Fano $3$-fold $X \subset \mathbb P^n$, assuming that $C$ is contained in a smooth hyperplane section $S \subset X$, that is a smooth Enriques surface in $X$. We give a sufficient…

Algebraic Geometry · Mathematics 2022-05-31 Hirokazu Nasu

In this paper, we give a method to evaluate minimum numbers of Dehn colors for knots by using symmetric local biquandle cocycle invariants. We give answers to some questions arising as a consequence of our previous paper [6]. In particular,…

Geometric Topology · Mathematics 2025-04-08 Eri Matsudo , Kanako Oshiro , Gaishi Yamagishi

Given a closed oriented PL four-manifold $X$ and a closed surface $B$ embedded in $X$ with isolated cone singularities, we give a formula for the signature of an irregular dihedral cover of $X$ branched along $B$. For $X$ simply-connected,…

Geometric Topology · Mathematics 2020-08-17 Alexandra Kjuchukova

In this paper we introduce a new invariant of virtual knots and links that is non-trivial for infinitely many virtuals, but is trivial on classical knots and links. The invariant is initially be expressed in terms of a relative of the…

Geometric Topology · Mathematics 2007-05-23 Louis H. Kauffman

Quantum knot invariants (like colored HOMFLY-PT or Kauffman polynomials) are a distinguished class of non-perturbative topological invariants. Any known way to construct them (via Chern-Simons theory or quantum R-matrix) starts with a…

High Energy Physics - Theory · Physics 2025-06-12 Dmitry Khudoteplov , Alexei Morozov , Alexey Sleptsov

We introduce virtual tribrackets, an algebraic structure for coloring regions in the planar complement of an oriented virtual knot or link diagram. We use these structures to define counting invariants of virtual knots and links and provide…

Geometric Topology · Mathematics 2018-12-07 Sam Nelson , Shane Pico

In this paper, we give a combinatorial description of the concordance invariant $\varepsilon$ defined by Hom in \cite{hom2011knot}, prove some properties of this invariant using grid homology techniques. We also compute $\varepsilon$ of…

Geometric Topology · Mathematics 2025-03-27 Subhankar Dey , Hakan Doga

We construct knot invariants from the radical part of projective modules of restricted quantum groups. We also show a relation between these invariants and the colored Alexander invariants.

Geometric Topology · Mathematics 2010-06-01 Jun Murakami , Kiyokazu Nagatomo

Given two smooth, oriented, closed 4-manifolds $M_1$ and $M_2$, we construct two invariants, $D^P(M_1, M_2)$ and $D(M_1, M_2)$, coming from distances in the pants complex and the dual curve complex respectively. To do this, we adapt work of…

Geometric Topology · Mathematics 2018-04-11 Gabriel Islambouli

Vassiliev's knot invariants can be computed in different ways but many of them as Kontsevich integral are very difficult. We consider more visual diagram formulas of the type Polyak-Viro and give new diagram formula for the two basic…

Algebraic Topology · Mathematics 2007-05-23 Svetlana D. Tyurina

We present new computations of tight shapes obtained using the constrained gradient descent code RIDGERUNNER for 544 composite knots with 12 and fewer crossings, expanding our dataset to 943 knots and links. We use the new data set to…

Differential Geometry · Mathematics 2015-05-30 Jason Cantarella , Al LaPointe , Eric Rawdon

We calculate limits of the colored Jones polynomials of the figure-eight knot and conclude that in most cases they determine the volumes and the Chern--Simons invariants of the three-manifolds obtained by Dehn surgeries along it.

Geometric Topology · Mathematics 2007-10-07 Hitoshi Murakami , Yoshiyuki Yokota

We use the LMO invariant to find constraints for a knot to admit a purely or reflectively cosmetic surgery. We also get a constraint for knots to admit a Lens space surgery, and some information for characterizing slopes.

Geometric Topology · Mathematics 2020-10-26 Tetsuya Ito

We prove the Kauffman-Harary Conjecture, posed in 1999: given a reduced, alternating diagram D of a knot with prime determinant p, every non-trivial Fox p-coloring of D will assign different colors to different arcs.

Geometric Topology · Mathematics 2014-10-01 Thomas W. Mattman , Pablo Solis

We define an invariant for the existence of r pointwise linearly independent sections in the tangent bundle of a closed manifold. For low values of r, explicit computations of the homotopy groups of certain Thom spectra combined with…

Algebraic Topology · Mathematics 2016-02-24 Marcel Bökstedt , Johan L. Dupont , Anne Marie Svane

Marked vertex diagrams provide a combinatorial way to represent knotted surfaces in $\mathbb{R}^4$; including virtual crossings allows for a theory of virtual knotted surfaces and virtual cobordisms. Biquandle counting invariants are…

Geometric Topology · Mathematics 2015-06-08 Sam Nelson , Patricia Rivera

For a positive integer $k$, a $k$-colouring of a graph $G=(V,E)$ is a mapping $c: V\rightarrow\{1,2,...,k\}$ such that $c(u)\neq c(v)$ whenever $uv\in E$. The Colouring problem is to decide, for a given $G$ and $k$, whether a $k$-colouring…

Computational Complexity · Computer Science 2016-02-16 Petr A. Golovach , Matthew Johnson , Daniël Paulusma , Jian Song
‹ Prev 1 4 5 6 7 8 10 Next ›