Related papers: Determinants of rational knots
We classify all knot diagrams of genus two and three, and give applications to positive, alternating and homogeneous knots, including a classification of achiral genus 2 alternating knots, slice or achiral 2-almost positive knots, a proof…
We present two families of knots which have straight number higher than crossing number. In the case of the second family, we have computed the straight number explicitly. We also give a general theorem about alternating knots that states…
We prove that every knot type in $\mathbb{R}^3$ can be parametrised by a smooth function $f:S^1\to\mathbb{R}^3$, $f(t)=(x(t),y(t),z(t))$ such that all derivatives $f^{(n)}(t)=(x^{(n)}(t),y^{(n)}(t),z^{(n)}(t))$, $n\in\mathbb{N}$,…
In the loop representation the quantum constraints of gravity can be solved. This fact allowed significant progress in the understanding of the space of states of the theory. The analysis of the constraints over loop dependent wavefunctions…
The homology and cohomology of quandles and racks are used in knot theory: given a finite quandle and a cocycle, we can construct a knot invariant. This is a quick introductory survey to the invariants of knots derived from quandles and…
We classify newforms with rational Fourier coefficients and complex multiplication for fixed weight up to twisting. Under the extended Riemann hypothesis for odd real Dirichlet characters, these newforms are finite in number. We produce…
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…
The Alexander polynomial of a knot has been generalized in three different ways to give twisted invariants. The resulting invariants are usually referred to as twisted Alexander polynomials, higher-order Alexander polynomials and…
Balanced colorings of networks classify robust synchrony patterns -- those that are defined by subspaces that are flow-invariant for all admissible ODEs. In symmetric networks the obvious balanced colorings are orbit colorings, where colors…
We examine computer experiments that can be performed to understand the dynamics of knots under self-repulsion. In the course of specific computer exploration we use the knot theory of rational knots and rational tangles to produce classes…
The theory of quandle (co)homology and cocycle knot invariants is rapidly being developed. We begin with a summary of these recent advances. One such advance is the notion of a dynamical cocycle. We show how dynamical cocycles can be used…
We study the behavior of the degree of the colored Jones polynomial and the boundary slopes of knots under the operation of cabling. We show that, under certain hypothesis on this degree, if a knot $K$ satisfies the Slope Conjecture then a…
The form factors of integrable models in finite volume are studied. We construct the explicite representations for the form factors in terms of determinants.
We consider braids with repeating patterns inside arbitrary knots which provides a multi-parametric family of knots, depending on the "evolution" parameter, which controls the number of repetitions. The dependence of knot (super)polynomials…
This paper studies cobordism and concordance for virtual knots. We define the affine index polynomial, prove that it is a concordance invariant for knots and links (explaining when it is defined for links), show that it is also invariant…
We resolve a case of the oriented knot complement conjecture by showing that knots in an orientable circle bundle $N$ over a genus $g \geq 2$ surface $S$ are determined by their complements. We apply this to the setting of canonical knots…
The paper develops a general theory of orderability of quandles with a focus on link quandles of tame links and gives some general constructions of orderable quandles. We prove that knot quandles of many fibered prime knots are…
We view the determinant and permanent as functions on directed weighted graphs and introduce their analogues for the undirected graphs. We prove that the task of computing the undirected determinants as well as permanents for planar graphs,…
We make use of the 3D nature of knots and links to find savings in computational complexity when computing knot invariants such as the linking number and, in general, most finite type invariants. These savings are achieved in comparison…
In this note we show that ribbon concordance forms a partial ordering on the set of knots, answering a question of Gordon. The proof makes use of representation varieties of the knot groups to $SO(N)$ and relations between them induced by a…