相关论文: Petal Projections, Knot Colorings and Determinants

A knot $K$ is called $(m,n)$-fertile if for every prime knot $K'$ whose crossing number is less than or equal to $m$, there exists an $n$-crossing diagram of $K$ such that one can get $K'$ from the diagram by changing its over-under…

We use Heegaard Floer homology to give obstructions to unknotting a knot with a single crossing change. These restrictions are particularly useful in the case where the knot in question is alternating. As an example, we use them to classify…

Classical knots in $\mathbb{R}^3$ can be represented by diagrams in the plane. These diagrams are formed by curves with a finite number of transverse crossings, where each crossing is decorated to indicate which strand of the knot passes…

We introduce the warping crossing polynomial of an oriented knot diagram by using the warping degrees of crossing points of the diagram. Given a closed transversely intersected plane curve, we consider oriented knot diagrams obtained from…

A knot is an an embedding of a circle into three-dimensional space. We say that a knot is unknotted if there is an ambient isotopy of the embedding to a standard circle. By representing knots via planar diagrams, we discuss the problem of…

We study the problem of connecting the parts of a multipartite graph using a minimum number of edges under a matching constraint. We introduce interconnection trees, defined as matchings whose projections onto the quotient graph form a…

An increasing sequence of integers is said to be universal for knots if every knot has a reduced regular projection on the sphere such that the number of edges of each complementary face of the projection comes from the given sequence.…

We enumerate and show tables of minimal diagrams for all prime knots up to the triple-crossing number equal to five. We derive a minimal generating set of oriented moves connecting triple-crossing diagrams of the same oriented knot. We also…

Region crossing change is a local transformation on a knot or link diagram. We show that a region crossing change on a knot diagram is an unknotting operation, and we define the region unknotting numbers for a knot diagram and a knot.

Traditionally, knot theorists have considered projections of knots where there are two strands meeting at every crossing. A triple crossing is a crossing where three strands meet at a single point, such that each strand bisects the…

We compose the table of knots in the thickened torus T x I having diagrams with at most 4 crossings. The knots are constructed by the three-step process. First we list regular graphs of degree 4 with at most 4 vertices, then for each graph…

A pseudodiagram is a diagram of a knot with some crossing information missing. We review and expand the theory of pseudodiagrams introduced by R. Hanaki. We then extend this theory to the realm of virtual knots, a generalization of knots.…

Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…

A knot is a closed loop in space without self-intersection. Two knots are equivalent if there is a self homeomorphism of space bringing one onto the other. An arc presentation is an embedding of a knot in the union of finitely many half…

The set consisting of all rotations of the Euclidean plane is equipped with a quandle structure. We show that a knot is colorable by this quandle if and only if its Alexander polynomial has a root on the unit circle in $\mathbb{C}$. Further…

Jigsaw percolation is a model for the process of solving puzzles within a social network, which was recently proposed by Brummitt, Chatterjee, Dey and Sivakoff. In the model there are two graphs on a single vertex set (the `people' graph…

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…

We use the Chebyshev knot diagram model of Koseleff and Pecker in order to introduce a random knot diagram model by assigning the crossings to be positive or negative uniformly at random. We give a formula for the probability of choosing a…

We call a Delta Diagram any diagram of a knot or link whose regions (including the unbounded one) have 3, 4, or 5 sides. We prove that any knot or link admits a delta diagram. We define and estimate combinatorial link invariants stemming…

This paper introduces a new systematic algorithm for constructing periodic Euclidean weaving diagrams with combinatorial arguments. It is shown that such a weaving diagram can be considered as a specific type of four-regular periodic planar…