相关论文: Unique diagram of a spatial arc and the knotting p…

In the classical knot theory there is a well-known notion of descending diagram. From an arbitrary diagram one can easily obtain, by some crossing changes, a descending diagram which is a diagram of the unknot or unlink. In this paper the…

This paper examines the relationship between the knotting of an embedded surface in $\R^3$ and the knotting of its fold curves, formed by the singular set of projection to a plane. The first result shows that every surface, no matter how…

When approximating a space curve, it is natural to consider whether the knot type of the original curve is preserved in the approximant. This preservation is of strong contemporary interest in computer graphics and visualization. We…

The probability of a random polygon (or a ring polymer) having a knot type $K$ should depend on the complexity of the knot $K$. Through computer simulation using knot invariants, we show that the knotting probability decreases exponentially…

We introduce the warping matrix which is a new description of oriented knots from a viewpoint of warping degree.

We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to…

The warping matrix has been defined for knot projections and knot diagrams by using warping degrees. In particular, the warping matrix of a knot diagram represents the knot diagram uniquely. In this paper we show that the rank of the…

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 define the knotting probability of a knot $K$ by the probability for a random polygon (RP) or self-avoiding polygon (SAP) of $N$ segments having the knot type $K$. We show fundamental and generic properties of the knotting probability…

We work with a generalization of knot theory, in which one diagram is reachable from another via a finite sequence of moves if a fixed condition, regarding the existence of certain morphisms in an associated category, is satisfied for every…

Two natural generalizations of knot theory are the study of spatial graphs and virtual knots. Our goal is to unify these two approaches into the study of virtual spatial graphs. This paper is a survey, and does not contain any new results.…

By a fixed continuous map from a $3$-space to itself, a knot in the $3$-space may be mapped to another knot in the $3$-space. We analyze possible knot types of them. Then we map a knot repeatedly by a fixed continuous map and analyze…

The knotting probability is defined by the probability with which an $N$-step self-avoiding polygon (SAP) with a fixed type of knot appears in the configuration space. We evaluate these probabilities for some knot types on a simple cubic…

Two isomorphic graphs can have inequivalent spatial embeddings in 3-space. In this way, an isomorphism class of graphs contains many spatial graph types. A common way to measure the complexity of a spatial graph type is to count the minimum…

The warping degree of an oriented knot diagram is the minimal number of crossings which we meet as an under-crossing first when we travel along the diagram from a fixed point. The warping degree of a knot projection is the minimal value of…

Given a knot K in the 3-sphere, consider a singular disk bounded by K and the intersections of K with the interior of the disk. The absolute number of intersections, minimised over all choices of singular disk with a given algebraic number…

For any two disjoint oriented circles embedded into the 3-dimensional real projective space, we construct a 3-dimensional configuration space and its map to the projective space such that the linking number of the circles is the half of the…

We compute the full probability distribution of the spectral form factor in the self-dual kicked Ising model by providing an exact lower bound for each moment and verifying numerically that the latter is saturated. We show that at large…

We extend the concepts of trivializing and knotting numbers for knots to spatial graphs and 2-bouquet graphs, in particular. Furthermore, we calculate the trivializing and knotting numbers for projections and pseudodiagrams of 2-bouquet…

We introduce the warping polynomial of an oriented knot diagram. In this paper, we characterize the warping polynomial, and define the span of a knot to be the minimal span of the warping polynomial for all diagrams of the knot. We show…