Related papers: Towards a Classification of Knots
This manuscript introduces a new framework for the study of knots by exploring the neighborhood of knot embeddings in the space of simple open and closed curves in 3-space. The latter gives rise to a knotoid spectrum, which determines the…
We generalize H. Seifert's algorithm for finding a Seifert surface for a knot or link. The generalization applies to "framed oriented measured lamination links." For knots, a Seifert surface determines a unique framing. In our setting, we…
The cubic lattice stick index of a knot type is the least number of sticks necessary to construct the knot type in the 3-dimensional cubic lattice. We present the cubic lattice stick index of various knots and links, including all…
We prove a conjecture of Crapo and Penne which characterizes isotopy classes of skew configurations with spindle-structure. We use this result in order to define an invariant, spindle-genus, for spindle-configurations. We also slightly…
Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings.…
We describe and analyze an interior-point method to decide feasibility problems of second-order conic systems. A main feature of our algorithm is that arithmetic operations are performed with finite precision. Bounds for both the number of…
This is a short expository article on alternating knots and is to appear in the Concise Encyclopedia of Knot Theory.
A polynomial knot is a smooth embedding $\kappa: \real \to \real^n$ whose components are polynomials. The case $n = 3$ is of particular interest. It is both an object of real algebraic geometry as well as being an open ended topological…
In this paper, we prove that the set of triangulations of a polygon can be equipped with an order to become a lattice. First, we define this order. In [HN99], authors defined the flip operator and then prove some properties of the graph of…
We consider multi-layered cake cutting in order to fairly allocate numerous divisible resources (layers of cake) among a group of agents under two constraints: contiguity and feasibility. We first introduce a new computational model in a…
The component-by-component construction is the standard method of finding good lattice rules or polynomial lattice rules for numerical integration. Several authors have reported that in numerical experiments the generating vector sometimes…
The (isothermic) compressibility of lattice knots can be examined as a model of the effects of topology and geometry on the compressibility of ring polymers. In this paper, the compressibility of minimal length lattice knots in the simple…
Garoufalidis conjectured a relation between the boundary slopes of a knot and its colored Jones polynomials. According to the conjecture, certain boundary slopes are detected by the sequence of degrees of the colored Jones polynomials. We…
Using methods of high performance computing, we have found indications that knotlike structures appear as stable finite energy solitons in a realistic 3+1 dimensional model. We have explicitly simulated the unknot and trefoil…
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…
This project explores the mathematical study of knots and links in topology, focusing on differentiating between the two-component Unlink and the Hopf Link using a computational tool named LINKAGE. LINKAGE employs the linking number,…
We observe that most known results of the form "v is not a finite-type invariant" follow from two basic theorems. Among those invariants which are not of finite type, we discuss examples which are "ft-independent" and examples which are…
Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.
The motivation for this work is to construct a map from classical knots to virtual ones. What we get in the paper is a series of maps from knots in the full torus (thickened torus) to flat-virtual knots. We give definition of flat-virtual…
Classifying the topology of closed curves is a central problem in low dimensional topology with applications beyond mathematics spanning protein folding, polymer physics and even magnetohydrodynamics. The central problem is how to determine…