English
Related papers

Related papers: Knot Colorings: Coloring and Goeritz matrices

200 papers

A classical knot is described by a one-stroke trajectory with entanglements of a string. The replica method appears as a powerful tool in statistical mechanics for a polymer or self-avoiding walk. We consider this replica N to 0 limit in…

Mathematical Physics · Physics 2023-03-09 Shinobu Hikami

This paper, to be regularly updated, lists those prime knots with the fewest possible number of crossings for which values of basic knot invariants, such as the unknotting number or the smooth 4-genus, are unknown. This list is being…

Geometric Topology · Mathematics 2018-08-16 Jae Choon Cha , Charles Livingston

Using the Gordon-Litherland pairing, one can define invariants (signature, nullity, determinant) for ${\mathbb Z}/2$ null-homologous links in thickened surfaces. In this paper, we study the concordance properties of these invariants. For…

Geometric Topology · Mathematics 2021-11-16 Hans U. Boden , Homayun Karimi

Bankwitz characterized an alternating diagram representing the trivial knot. A non-alternating diagram is called almost alternating if one crossing change makes the diagram alternating. We characterize an almost alternaing diagram…

Geometric Topology · Mathematics 2014-02-26 Tatsuya Tsukamoto

We define a filtration on the vector space spanned by Seifert matrices of knots related to Vassiliev's filtration on the space of knots. Further we show that the invariants of knots derived from the filtration can be expressed by…

Geometric Topology · Mathematics 2007-05-23 Hitoshi Murakami , Tomotada Ohtsuki

A Fox p-colored knot $K$ in $S^3$ gives rise to a $p$-fold branched cover $M$ of $S^3$ along $K$. The pre-image of the knot $K$ under the covering map is a $\dfrac{p+1}{2}$-component link $L$ in $M$, and the set of pairwise linking numbers…

Geometric Topology · Mathematics 2022-01-03 Patricia Cahn , Elise Catania , Sarangoo Chimgee , Olivia Del Guercio , Jack Kendrick

In this paper, we prove a formula for the 2-head of the colored Jones polynomial for an infinite family of pretzel knots. Following Hall, the proof utilizes skein-theoretic techniques and a careful examination of higher order stability…

Geometric Topology · Mathematics 2019-05-10 Paul Beirne

In this note, I describe a formalism for treating knots as geometric spaces, and make an application to a simple statistical mechanics computation. The motivation for this study is the natural visual symmetry of the knot, and I describe how…

Statistical Mechanics · Physics 2013-07-04 Robert Kariotis

We provide a way to produce knots in $S^3$ from signed chord diagrams, and prove that every knot can be produced in this way. Using these diagrams, we generalize the fundamental theorem of finite type invariants. We also provide moves for…

Geometric Topology · Mathematics 2018-07-02 Cole Hugelmeyer

We use the knot filtration on the Heegaard Floer complex to define an integer invariant tau(K) for knots. Like the classical signature, this invariant gives a homomorphism from the knot concordance group to Z. As such, it gives lower bounds…

Geometric Topology · Mathematics 2014-11-11 Peter Ozsvath , Zoltan Szabo

A special class of braids, called woven, is introduced and it is shown that every conjugation class of the braid group contains woven braids. In consequence, links can be presented as plats or closures of woven braids. Restricting on knots,…

q-alg · Mathematics 2008-02-03 Jan A. Kneissler

In this article we show that if a knot diagram admits a non-trivial coloring modulo 13 then there is an equivalent diagram which can be colored with 5 colors. Leaning on known results, this implies that the minimum number of colors modulo…

Geometric Topology · Mathematics 2015-10-06 Filipe Bento , Pedro Lopes

We discuss the possibility of the existence of finite algorithms that may give distinct knot classes. In particular we present two attempts for such algorithms which seem promising, one based on knot projections on a plane, the other on…

High Energy Physics - Theory · Physics 2008-02-03 Charilaos Aneziris

We construct knot invariants from solutions to the Yang--Baxter equation associated to appropriately generalized left/right Yetter--Drinfel'd modules over a braided Hopf algebra with an automorphism. When applied to Nichols algebras, our…

Geometric Topology · Mathematics 2024-04-24 Stavros Garoufalidis , Rinat Kashaev

For a reduced alternating diagram of a knot with a prime determinant $p,$ the Kauffman-Harary conjecture states that every non-trivial Fox $p$-coloring of the knot assigns different colors to its arcs. In this paper, we prove a…

Geometric Topology · Mathematics 2025-08-20 Rhea Palak Bakshi , Huizheng Guo , Gabriel Montoya-Vega , Sujoy Mukherjee , Józef H. Przytycki

Garoufalidis conjectured a relation between the boundary slopes of a knot and its colored Jones polynomials. According to the conjecture, certain boundary slopes are detected by the sequence of degrees of the colored Jones polynomials. We…

Geometric Topology · Mathematics 2011-05-20 David Futer , Efstratia Kalfagianni , Jessica S. Purcell

In this note, we prove a lower bound for the positive kinkiness of a closed braid which we then use to derive an estimate for the positive kinkiness of a link in terms of its Seifert system. As an application, we show that certain pretzel…

Geometric Topology · Mathematics 2007-05-23 Christian Bohr

Simple closed curves in the plane can be mapped to nontrivial knots under the action of origami foldings that allow the paper to self-intersect. We show all tame knot types may be produced in this manner, motivating the development of a new…

Geometric Topology · Mathematics 2021-05-05 Joseph Slote , Thomas Bertschinger

The concordance genus of a knot K is the minimum three-genus among all knots concordant to K. For prime knots of 10 or fewer crossings there have been three knots for which the concordance genus was unknown. Those three cases are now…

Geometric Topology · Mathematics 2014-10-01 Charles Livingston

An edge-colored graph $G$ is said to be rainbow connected if between each pair of vertices there exists a path which uses each color at most once. The rainbow connection number, denoted by $rc(G)$, is the minimum number of colors needed to…

Discrete Mathematics · Computer Science 2015-10-14 Eduard Eiben , Robert Ganian , Juho Lauri