相关论文: The complete list of prime knots whose flat plumbi…
Flat plumbing basket surfaces of links were introduced to study the geometry of the complement of the links. In present article, we study links of the flat plumbing basket numbers $4$ or less using a special presentation of the flat…
The existence of basket, flat plumbing and flat plumbing basket surfaces of a link was first proven from a braid representative of the link. In the present article, we show the existence of such surfaces from an induced graph of the link.…
We define the basket number, the flat plumbing number and the flat plumbing basket number of a link. Then we provide some upperbounds for these plumbing numbers by using Seifert's algorithm. We study the relation between these plumbing…
The flat plumbing basket presentation of a link is introduced by Furihata, Hirasawa and Kobayashi. In this paper, we show that the pass-equivalence and an equivalence introduced by using the flat plumbing basket presentation are the same…
A flat plumbing basket is a Seifert surface consisting of a disk and bands contained in distinct pages of the disk open book decomposition of the 3-sphere. In this paper, we examine close connections between flat plumbing baskets and the…
A flat plumbing basket is a surface consisting a disk and finitely many bands which are contained in distinct pages of the trivial open book decomposition of $\mathbf{S}^{3}$. In this paper, we construct a Legendrian link from a flat…
Kakimizu complexes have been found for several classes of links. O.Kakimizu found the Kakimizu complexes of knots with crossing number less than or equal to 10. Hatcher and Thurston found the 0-skeleton of the Kakimizu complex of 2-bridge…
We use matchings on Lyndon words to classify flat knots up to 8 crossings. Using flat knots invariants such as the based matrix, the $\phi$-invariant, the flat arrow polynomial, and the flat Jones-Krushkal polynomial, we distinguish all…
In 2008, Kauffman and Lomonaco introduce the concepts of a knot mosaic and the mosaic number of a knot or link, the smallest integer $n$ such that a knot or link can be represented on an $n$-mosaic. In arXiv:1702.06462, the authors explore…
This is the first in a series of four papers wherein we enumerate all prime alternating knots and links. In this first paper, we introduce four operators on knots and show that, when used according to very simple rules on the prime…
In this article, we give a list of minimal grid diagrams of the 12 crossing prime alternating knots. This is a continuation of the work in https://doi.org/10.1142/S0218216520500765
Yoshikawa made a table of knotted surfaces in R^4 with ch-index 10 or less. This remarkable table is the first to enumerate knotted surfaces analogous to the classical prime knot table. A broken sheet diagram of a surface-link is a generic…
This is the third paper in a series devoted to enumerating the prime alternating knots and links. This paper establishes a method for enumerating the prime alternating links. It is shown that one may choose any prime alternating link…
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.…
A partial order on the set of prime knots can be defined by the existence of an epimorphism between knot groups. We prove that all the prime knots with up to $6$ crossings are minimal. We also show that each fibered knot with the…
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…
We study the minimum ribbonlength for immersed planar ribbon knots and links. Our approach is to embed the space of such knots and links into a larger more tractable space of disk diagrams. When length minimisers in disk diagram space are…
We investigate the minimal number of links and knots in complete partite graphs. We provide exact values or bounds on the minimal number of links for all complete partite graphs with all but 4 vertices in one partition, or with 9 vertices…
Every link is shown to be presentable as a boundary of an unknotted flat banded surface. A (flat) banded link is defined as a boundary of an unknotted (flat) banded surface. A link's (flat) band index is defined as the minimum number of…
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.…