English
Related papers

Related papers: Dehn coloring and the dimer model for knots

200 papers

An elementary introduction to knot theory and its link to quantum field theory is presented with an intention to provide details of some basic calculations in the subject, which are not easily found in texts. Study of Chern-Simons theory…

High Energy Physics - Theory · Physics 2022-05-10 Shoaib Akhtar

On a finite weighted graph, the dimer model is a probability measure on its dimer covers, that assigns to any cover a probability proportional to the product of the weights of its edges. For planar bipartite graphs, dimer correlations are…

Probability · Mathematics 2026-05-06 Tomas Berggren , Alexei Borodin , Terrence George

Deep learning has consistently defied state-of-the-art techniques in many fields over the last decade. However, we are just beginning to understand the capabilities of neural learning in symbolic domains. Deep learning architectures that…

Machine Learning · Computer Science 2020-03-10 Henrique Lemos , Marcelo Prates , Pedro Avelar , Luis Lamb

This paper serves as the first extension of the topic of dominator colorings of graphs to the setting of digraphs. We establish the dominator chromatic number over all possible orientations of paths and cycles. In this endeavor we discover…

Combinatorics · Mathematics 2019-02-21 Michael Cary

We define and study a bigraded knot invariant whose Euler characteristic is the Alexander polynomial, closely connected to knot Floer homology. The invariant is the homology of a chain complex whose generators correspond to Kauffman states…

Geometric Topology · Mathematics 2018-02-06 Peter Ozsvath , Zoltan Szabo

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

In this chapter (Chapter V) we present several results which demonstrate a close connection and useful exchange of ideas between graph theory and knot theory. These disciplines were shown to be related from the time of Tait (if not Listing)…

Geometric Topology · Mathematics 2007-05-23 Jozef H. Przytycki

In this article we discuss applications of neural networks to recognising knots and, in particular, to the unknotting problem. One of motivations for this study is to understand how neural networks work on the example of a problem for which…

Geometric Topology · Mathematics 2022-11-28 L. H. Kauffman , N. E. Russkikh , I. A. Taimanov

We study the structural properties of colored Kauffman homologies of knots. Quadruple-gradings play an essential role in revealing the differential structure of colored Kauffman homology. Using the differential structure, the Kauffman…

High Energy Physics - Theory · Physics 2014-04-22 Satoshi Nawata , P. Ramadevi , Zodinmawia

We examine $t$-colourings of oriented graphs in which, for a fixed integer $k \geq 1$, vertices joined by a directed path of length at most $k$ must be assigned different colours. A homomorphism model that extends the ideas of Sherk for the…

Discrete Mathematics · Computer Science 2023-06-22 Christopher Duffy , Gary MacGillivray , Éric Sopena

The pair (K,r) consisting of a knot K and a surjective map r from the knot group onto a dihedral group is said to be a p-colored knot. D. Moskovich conjectured that for any odd prime p there are exactly p equivalence classes of p-colored…

Geometric Topology · Mathematics 2007-11-06 R. A. Litherland , Steven D. Wallace

Construction of (colored) knot polynomials for double-fat graphs is further generalized to the case when "fingers" and "propagators" are substituting R-matrices in arbitrary closed braids with m-strands. Original version of arXiv:1504.00371…

High Energy Physics - Theory · Physics 2015-08-31 A. Mironov , A. Morozov

We show that an effective version of Siegel's Theorem on finiteness of integer solutions and an application of elementary Galois theory are key ingredients in a complexity classification of some Holant problems. These Holant problems,…

Computational Complexity · Computer Science 2014-04-16 Jin-Yi Cai , Heng Guo , Tyson Williams

We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…

Geometric Topology · Mathematics 2019-11-11 Jacob Mostovoy , Michael Polyak

We employ the sl(2) foam cohomology to define a cohomology theory for oriented framed tangles whose components are labelled by irreducible representations of U_q(sl(2)). We show that the corresponding colored invariants of tangles can be…

Geometric Topology · Mathematics 2015-04-01 Carmen Caprau

A G-coloured knot is a knot together with a representation of its knot group onto G. Two G-coloured knots are said to be rho-equivalent if they are related by surgery around unit framed unknots in the kernels of their colourings. The…

Geometric Topology · Mathematics 2011-01-04 Daniel Moskovich

Defect characterizes the depth of factorization of terms in differential (cyclotomic) expansions of knot polynomials, i.e. of the non-perturbative Wilson averages in the Chern-Simons theory. We prove the conjecture that the defect can be…

High Energy Physics - Theory · Physics 2023-03-16 E. Lanina , A. Morozov

The colored Jones function of a knot is a sequence of Laurent polynomials. It was shown by TTQ. Le and the author that such sequences are $q$-holonomic, that is, they satisfy linear $q$-difference equations with coefficients Laurent…

Geometric Topology · Mathematics 2007-05-23 Stavros Garoufalidis

Relations will be described between the quandle cocycle invariant and the minimal number of colors used for non-trivial Fox colorings of knots and links. In particular, a lower bound for the minimal number is given in terms of the quandle…

Geometric Topology · Mathematics 2009-05-28 Masahico Saito

Pseudodiagrams are diagrams of knots where some information about which strand goes over/under at certain crossings may be missing. Pseudoknots are equivalence classes of pseudodiagrams, with equivalence defined by a class of…

Geometric Topology · Mathematics 2013-05-29 Allison Henrich , Slavik Jablan