Related papers: A neural network approach to predicting and comput…
Ascending numbers are determined for 64 knots with at most n=10 crossings. After proving the theorem about the signature of alternating knot families, we distinguished all families of knots obtained from generating alternating knots with at…
We present experimental results on knotting in off-lattice self-avoiding polygons in the bead-chain model. Using Clisby's tree data structure and the scale-free pivot algorithm, for each $k$ between $10$ and $27$ we generated $2^{43-k}$…
This paper describes a method for the automatic evaluation of the Links-Gould two-variable polynomial link invariant (LG) for any link, given only a braid presentation. This method is currently feasible for the evaluation of LG for links…
Given any unoriented link diagram, a group of new knot invariants are constructed. Each of them satisfies a generalized 4 term skein relation. The coefficients of each invariant is from a commutative ring. Homomorphisms and representations…
Many invariants of knots rely upon smoothing the knot at its crossings. To compute them, it is necessary to know how to count the number of connected components the knot diagram is broken into after the smoothing. In this paper, it is shown…
Generalizing unknotting number, $n$-adjacent knots have $n$ crossings such that changing any non-empty subset of them results in the unknot. In this paper, we determine the 2-adjacent knots through 12 crossings. Using Heegaard Floer…
Families of alternating knots (links) and tangles are studied using as building block the conway defined as the twisting of two strands. The regular representation of knots assumes the projection has the minimal number of overpassings, and…
We introduce twelve polynomial invariants for long virtual knots, called intersection polynomials, extending and refining the three intersection polynomials for virtual knots. They are defined via intersection numbers of cycles on a closed…
We describe an alternative way of computing Alexander polynomials of knots/links, based on the Artin representation of the corresponding braids by automorphisms of a free group. Then we apply the same method to other representations of…
An accurate impact parameter determination in a heavy ion collision is crucial for almost all further analysis. The capabilities of an artificial neural network are investigated to that respect. A novel input generation for the network is…
We prove that if an alternating knot has unknotting number one, then there exists an unknotting crossing in any alternating diagram. This is done by showing that the obstruction to unknotting number one developed by Greene in his work on…
The topological underpinnings are presented for a new algorithm which answers the question: `Is a given knot the unknot?' The algorithm uses the braid foliation technology of Bennequin and of Birman and Menasco. The approach is to consider…
A Gauss diagram is a simple, combinatorial way to present a knot. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting (with signs and multiplicities) subdiagrams of certain…
We develop a fully automatic Bayesian Lasso via variational inference. This is a scalable procedure for approximating the posterior distribution. Special attention is driven to the knot selection in regression spline. In order to carry…
We present an elementary introduction to one of the most important today knot theory approaches, which gives rise to a representation for a class of knot polynomials in terms of quantum groups. Historically, the approach was at the same…
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…
We explain equivariant neural networks, a notion underlying breakthroughs in machine learning from deep convolutional neural networks for computer vision to AlphaFold 2 for protein structure prediction, without assuming knowledge of…
Symmetries of knots have been studied extensively, and strongly invertible knots are one of them. Lamm defined the equivariant crossing number $c_t(K)$, the minimum crossing number among all symmetric diagrams for a strongly invertible knot…
We prove that parities on virtual knots come from invariant 1-cycles on the arcs of knot diagrams. In turn, the invariant cycles are determined by quasi-indices on the crossings of the diagrams. The found connection between the parities and…
Link prediction methods use patterns in known network data to infer which connections may be missing. Previous work has shown that continuous-time quantum walks can be used to represent path-based link prediction, which we further study…