Related papers: An algorithm for comparing Legendrian knots

Link prediction is one of the fundamental problems in network analysis. In many applications, notably in genetics, a partially observed network may not contain any negative examples of absent edges, which creates a difficulty for many…

Group convolutions and cross-correlations, which are equivariant to the actions of group elements, are commonly used in mathematics to analyze or take advantage of symmetries inherent in a given problem setting. Here, we provide efficient…

Algorithm of construction of all knots, links with given number of crosses on diagram of knot, link is offered. This algorithm is based on simple proposition, that there is a representation of knot (link) as closure of braid with n threads…

This paper introduces the concept of Conjectural Link for Complex Networks, in particular, social networks. Conjectural Link we understand as an implicit link, not available in the network, but supposed to be present, based on the…

A Legendrian link is called a d\'ej\`a vu link if its components can be connected by a positive Legendrian isotopy but this isotopy cannot be embedded. This is the contact geometric analogue of a pair of events in a spacetime such that…

We construct a combinatorial invariant of Legendrian knots in standard contact three-space. This invariant, which encodes rational relative Symplectic Field Theory and extends contact homology, counts holomorphic disks with an arbitrary…

In a previous paper (q-alg/9501022) we suggested some algorithms that could be useful in solving the problem of knot classification. Here we continue this discussion by answering questions raised in that paper and by commenting on practical…

In this paper, we provide the necessary and sufficient conditions for the connected sum of knots in $S^3$ to be Legendrian simple.

The problem of link prediction, predicting if two nodes in a network have a connection between them, is a theoretical problem with numerous field-agnostic real-world applications. This paper investigates the efficacy of three classes of…

In statistical relational learning, the link prediction problem is key to automatically understand the structure of large knowledge bases. As in previous studies, we propose to solve this problem through latent factorization. However, here…

We classify Legendrian rational unknots with tight complements in the lens spaces L(p,1) up to coarse equivalence. As an example of the general case, this classification is also worked out for L(5,2). The knots are described explicitly in a…

We describe an algorithm to find ribbon disks for alternating knots, and the results of a computer implementation of this algorithm. The algorithm is underlain by a slice link obstruction coming from Donaldson's diagonalisation theorem. It…

Virtual knots, defined by Kauffman, provide a natural generalization of classical knots. Most invariants of knots extend in a natural way to give invariants of virtual knots. In this paper we study the fundamental groups of virtual knots…

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…

We explain an algorithm for finding a boundary link Seifert matrix for a given Alexander polynomial. The algorithm depends on several choices and therefore makes it possible to find non-equivalent Seifert matrices for a given Alexander…

We give a purely combinatorial proof of a K\"{u}nneth formula for the minus version of knot Floer homology of connected sums by constructing a quasi-isomorphism of grid chain complexes. The quasi-isomorphism naturally deduces that the…

In this paper, we study Legendrian realizations of cable links of knot types that are uniformly thick but not Legendrian simple, extending prior work of Dalton, the second author, and Traynor. This leads to new phenomena, such as stabilized…

For large ranks, there is no good algorithm that decides whether a given lattice has an orthonormal basis. But when the lattice is given with enough symmetry, we can construct a provably deterministic polynomial-time algorithm to accomplish…

In this methodological article on experimental-yet-rigorous enumerative combinatorics, we use two instructive case studies, to show that often, just like Alexander the Great before us, the simple, "cheating" solution to a hard problem is…

We establish an upper bound for the Thurston-Bennequin number of a Legendrian link using the Khovanov homology of the underlying topological link. This bound is sharp in particular for all alternating links, and knots with nine or fewer…