Related papers: Surface-link families with arbitrarily large tripl…
A branched covering surface-knot is a surface-knot in the form of a branched covering over an oriented surface-knot $F$, where we include the case when the covering has no branch points. A branched covering surface-knot is presented by a…
We introduce the triple crossing number, a variation of crossing number, of a graph, which is the minimal number of crossing points in all drawings with only triple crossings of the graph. It is defined to be zero for a planar graph, and to…
A tripartite-circle drawing of a tripartite graph is a drawing in the plane, where each part of a vertex partition is placed on one of three disjoint circles, and the edges do not cross the circles. The tripartite-circle crossing number of…
Meier and Zupan proved that an orientable surface $\mathcal{K}$ in $S^4$ admits a tri-plane diagram with zero crossings if and only if $\mathcal{K}$ is unknotted, so that the crossing number of $\mathcal{K}$ is zero. We determine the…
In this paper we compute upper bounds for the number of ordinary triple points on a hypersurface in $P^3$ and give a complete classification for degree six (degree four or less is trivial, and five is elementary). But the real purpose is to…
A revised proof of the author's earlier result is given. It is shown that a boundary surface-link in the 4-sphere is a ribbon surface-link if the surface-link obtained from it by surgery along a pairwise nontrivial fusion 1-handle system is…
A surface-link is a closed surface embedded in the 4-space, possibly disconnected or non-orientable. Every surface-link can be presented by the plat closure of a braided surface, which we call a plat form presentation. The knot symmetric…
A triple crossing is a crossing in a projection of a knot or link that has three strands of the knot passing straight through it. A triple crossing projection is a projection such that all of the crossings are triple crossings. We prove…
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…
A Gauss diagram is a simple, combinatorial way to present a knot. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting (with signs and multiplicities) subdiagrams of certain…
A tripartite-circle drawing of a tripartite graph is a drawing in the plane, where each part of a vertex partition is placed on one of three disjoint circles, and the edges do not cross the circles. We present upper and lower bounds on the…
A knot (or link) diagram is said to be everywhere equivalent if all the diagrams obtained by switching one crossing represent the same knot (or link). We classify such diagrams of a closed 3-braid.
It is known that if a classical link group is a free abelian group, then its rank is at most two. It is also known that a $k$-component 2-link group ($k>1$) is not free abelian. In this paper, we give examples of $T^2$-links each of whose…
We introduce a new numerical knot invariant, termed the \textit{segment number}, which is derived from partitioned knot diagrams subject to specific over/under-crossing constraints. We prove that a knot is non-trivial if and only if its…
A knitted surface is a surface with or without closed components smoothly properly embedded in $D^2 \times B^2$, which is a generalization of a braided surface. A knitted surface is called a 2-dimensional knit if its boundary is the closure…
We describe the structure of triconnected graph with the help of its decomposition by 3-cutsets. We divide all 3-cutsets of a triconnected graph into rather small groups with a simple structure, named complexes. The detailed description of…
A classification of spanning surfaces for alternating links is provided up to genus, orientability, and a new invariant that we call aggregate slope. That is, given an alternating link, we determine all possible combinations of genus,…
We say that a graph is intrinsically knotted or completely 3-linked if every embedding of the graph into the 3-sphere contains a nontrivial knot or a 3-component link any of whose 2-component sublink is nonsplittable. We show that a graph…
We consider surface links in the 4-space which are presented by the form of simple branched coverings over the standard torus, which we call torus-covering links. In this paper, we study unknotting numbers of torus-covering links. In some…
We prove the meridional rank conjecture for arborescent links associated to plane trees with the following property: all branching points carry a straight branch to at least three leaves. The proof involves an upper bound on the bridge…