Related papers: An algorithm for comparing Legendrian knots
We define half grid diagrams and prove every link is half grid presentable by constructing a canonical half grid pair (which gives rise to a grid diagram of some special type) associated with an element in the oriented Thompson group. We…
The list of knots with up to 10 crossings is commonly referred to as the Rolfsen Table. This paper presents a way to generate the Rolfsen table in a simple, clear, and reproducible manner. The methods we use are similar to those used by J.…
In \cite{Kim} it is shown that knots in $S_{g} \times S^{1}$ can be presented by virtual diagrams with a decoration, so called, {\em double lines}. In this paper, we study the essential diagram for each knot in $S_{g} \times S^{1}$, which…
The objective of ordinal embedding is to find a Euclidean representation of a set of abstract items, using only answers to triplet comparisons of the form "Is item $i$ closer to the item $j$ or item $k$?". In recent years, numerous…
A virtual link diagram is called {\em (mod $m$) almost classical} if it admits a (mod $m$) Alexander numbering. In \cite{BodenGaudreauHarperNicasWhite}, it is shown that Alexander polynomial for almost classical links can be defined by…
Community detection and link prediction are both of great significance in network analysis, which provide very valuable insights into topological structures of the network from different perspectives. In this paper, we propose a novel…
Let K be a number field, let A be a finite dimensional semisimple K-algebra and let Lambda be an O_K-order in A. It was shown in previous work that, under certain hypotheses on A, there exists an algorithm that for a given (left)…
We show that the genus problem for alternating knots with $n$ crossings has linear time complexity and is in Logspace$(n)$. Almost all alternating knots of given genus possess additional combinatorial structure, we call them standard. We…
A principled approach to understand network structures is to formulate generative models. Given a collection of models, however, an outstanding key task is to determine which one provides a more accurate description of the network at hand,…
When are two algorithms the same? How can we be sure a recently proposed algorithm is novel, and not a minor twist on an existing method? In this paper, we present a framework for reasoning about equivalence between a broad class of…
Link prediction has aroused extensive attention since it can both discover hidden connections and predict future links in the networks. Many unsupervised link prediction algorithms have been proposed to find these links in a variety of…
We study Legendrian knots in a cabled knot type. Specifically, given a topological knot type K, we analyze the Legendrian knots in knot types obtained from K by cabling, in terms of Legendrian knots in the knot type K. As a corollary of…
A connection between holomorphic and generating family invariants of Legendrian knots is established; namely, that the existence of a ruling (or decomposition) of a Legendrian knot is equivalent to the existence of an augmentation of its…
In order to find Hamiltonian cycle, algorithm should find edges that creates a Hamiltonian cycle. Higher number of edges creates more possibilities to check to solve the problem. Algorithm rests on analysis of original graph and opposite…
In this short note we observe that a result of Eliashberg and Polterovitch allows to use the doubly slice genus as an obstruction for a Legendrian knot to be a slice of a concordance from the trivial Legendrian knot with maximal…
We prove that every Legendrian knot in the tight contact structure of the 3-sphere is determined by the contactomorphism type of its exterior. Moreover, by giving counterexamples we show this to be not true for Legendrian links in the tight…
Link prediction is a common problem in network science that transects many disciplines. The goal is to forecast the appearance of new links or to find links missing in the network. Typical methods for link prediction use the topology of the…
Tasks that model the relation between pairs of tokens in a string are a vital part of understanding natural language. Such tasks, in general, require exhaustive pair-wise comparisons of tokens, thus having a quadratic runtime complexity in…
The Thurston-Bennequin invariant provides one notion of self-linking for any homologically-trivial Legendrian curve in a contact three-manifold. Here we discuss related analytic notions of self-linking for Legendrian knots in Euclidean…
Many complex systems can be represented as networks, and the problem of network comparison is becoming increasingly relevant. There are many techniques for network comparison, from simply comparing network summary statistics to…