Related papers: Knot probabilities in equilateral random polygons
We study global distribution of zeros for a wide range of ensembles of random polynomials. Two main directions are related to almost sure limits of the zero counting measures, and to quantitative results on the expected number of zeros in…
In this paper we discuss a pair of polynomial knot invariants $\Theta=(\Delta,\theta)$ which is: * Theoretically and practically fast: $\Theta$ can be computed in polynomial time. We can compute it in full on random knots with over 300…
We explore free knot diagrams, which are projections of knots into the plane which don't record over/under data at crossings. We consider the combinatorial question of which free knot diagrams give which knots and with what probability.…
The unknotting number is the classical invariant of a knot. However, its determination is difficult in general. To obtain the unknotting number from definition one has to investigate all possible diagrams of the knot. We tried to show the…
We model the typical behavior of knots and links using grid diagrams. Links are ubiquitous in the sciences, and their "normal" or "typical" behavior is of significant importance in understanding situations such as the topological state of…
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…
In this paper, we study the arithmetics of skew polynomial rings over finite fields, mostly from an algorithmic point of view. We give various algorithms for fast multiplication, division and extended Euclidean division. We give a precise…
Homology groups of spaces of nonsingular polynomial embeddings ${\bf R}^1 \to {\bf R}^n$ of degrees $\le 4$ are calculated. A general algebraic technique of such calculations for spaces of polynomial knots of arbitrary degrees is described.
We develop a dimer model for the Alexander polynomial of a knot. This recovers Kauffman's state sum model for the Alexander polynomial using the language of dimers. By providing some additional structure we are able to extend this model to…
We introduce natural language processing into the study of knot theory, as made natural by the braid word representation of knots. We study the UNKNOT problem of determining whether or not a given knot is the unknot. After describing an…
It is shown that the projection image of an oriented spatial arc to any oriented plane is approximated by a unique arc diagram (up to isomorphic arc diagrams) determined from the spatial arc and the projection. In a separated paper, the…
Early last century witnessed both the complete classification of 2-dimensional manifolds and a proof that classification of 4-dimensional manifolds is undecidable, setting up 3-dimensional manifolds as a central battleground of topology to…
This paper visualizes a knot reduction algorithm
In recent years, twisted Alexander polynomial has been playing an important role in low-dimensional topology. For Montesinos links, we develop an efficient method to compute the twisted Alexander polynomial associated to any linear…
We describe a new algorithm, the reflection method, to generate off-lattice random walks of specified, though arbitrarily large, thickness in $\mathbb{R}^3$ and prove that our method is ergodic on the space of thick walks. The data…
We describe a generalized scheme for the probability-changing cluster (PCC) algorithm, based on the study of the finite-size scaling property of the correlation ratio, the ratio of the correlation functions with different distances. We…
In arXiv:1208.0365 entanglement polytopes where introduced as a coarsening of the SLOCC classification of multipartite entanglement. The advantages of classifying entanglement by entanglement polytopes are a finite hierarchy for all…
We consider the problem of finding and enumerating polyominos that can be folded into multiple non-isomorphic boxes. While several computational approaches have been proposed, including SAT, randomized algorithms, and decision diagrams,…
We present an algorithm for bounding the probability of r-core formation in k-uniform hypergraphs. Understanding the probability of core formation is useful in numerous applications including bounds on the failure rate of Invertible Bloom…
We study two important operations on polynomials defined over complete discrete valuation fields: Euclidean division and factorization. In particular, we design a simple and efficient algorithm for computing slope factorizations, based on…