SearcharxivSearch

arXiv subjects

Inasa Nakamura

Publications and source records attributed to Inasa Nakamura.

At least 19 recordsLinked to original sources

Chirality of torus-covering $T^2$-links of degree three

A torus-covering $T^2$-link of degree $n$ is a surface-link consisting of tori, in the form of an unbranched covering of degree $n$ over the standard torus. We focus on a torus-covering $T^2$-link of degree 3, which is determined by a pair $(a,b)$ of 3-braids satisfying $ab=ba$, denoted by $\mathcal{S}_3(a,b)$. We investigate to what extent the chirality of $\mathcal{S}_3(a,b)$ is detected by invariants such as the triple linking numbers, the number of Fox $p$-colorings, and the quandle cocycle invariant associated with $p$-colorings. In particular, we determine the quandle cocycle invariant for $\mathcal{S}_3(a,b)$ associated with tri-colorings.

math.GT

Closure of knitted surfaces and surface-links

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 of a trivial braid. From a 2-dimensional knit $S$, we obtain a surface-link in $\mathbb{R}^4$ by taking the closure of $S$. We show that any surface-link is ambient isotopic to the closure of some 2-dimensional knit. Further, we consider another type of the closure of a knitted surface, called the plat closure. It is known that any trivial surface-knot is ambient isotopic to the plat closure of a knitted surface of degree 2. We show that the plat closure of any knitted surface of degree 2 is a trivial surface-link, and any trivial surface-link is ambient isotopic to the plat closure of a knitted surface of degree $2$. We also show the same result for the closure of 2-dimensional knits of degree 2.

math.GT

Deformations of dotted graphs consisting of standard circles

Dotted graphs are certain finite graphs with vertices of degree 2 called dots in the $xy$-plane $\mathbb{R}^2$, and a dotted graph is said to be admissible if it is associated with a lattice polytope in $\mathbb{R}^2$ each of whose edge is parallel to the $x$-axis or the $y$-axis. A dotted graph is said to be reducible if certain types of deformations are applicable. In this paper, we investigate the reducibility of admissible dotted graphs in certain simple forms consisting of standard circles.

math.GT

Transformations of lattice diagrams and their associated dotted diagrams

We consider a graph called a lattice diagram, which is a graph in the $xy$-plane such that each edge is parallel to the $x$-axis or the $y$-axis. In [4], we investigated transformations of certain lattice diagrams, and we considered the reduced diagram that is obtained from deformations of a diagram associated with a lattice diagram. In this paper, we refine the notion of the reduced diagram by introducing the notion of a dotted diagram. A lattice diagram is presented by an admissible dotted diagram. We investigate deformations of dotted diagrams, and we investigate relation between deformations of admissible dotted diagrams and transformations of lattice diagrams, giving results that are refined and corrected versions of [4, Lemma 6.2, Theorem 6.3].

math.GT

Surfaces in the 4-ball constructed using generators of knits and their graphical description

We introduce a new construction of surfaces in $D^2 \times B^2$, called knitted surfaces or BMW surfaces, which are described as the trace of deformations of knits. Here, knits are tangles obtained from classical braids from splicing at some crossings. Knitted surfaces are a generalization of braided surfaces. Further, we generalize charts of braided surfaces to BMW charts of knitted surfaces, which are finite graphs in $B^2$, and we show that a knitted surface has a BMW chart description. We show that every compact surface with non-empty boundaries properly embedded in $D^2 \times B^2$ is ambiently isotopic to some knitted surface: so such surfaces are described by BMW charts.

math.GT

Torus-covering knot groups and their irreducible metabelian $SU(2)$-representations

A torus-covering $T^2$-knot is a surface-knot of genus one determined from a pair of commutative braids. For a torus-covering $T^2$-knot $F$, we determine the number of irreducible metabelian $SU(2)$-representations of the knot group of $F$ in terms of the knot determinant of $F$. It is similar to the result due to Lin for the knot group of a classical knot. Further, we investigate the number of irreducible metabelian $SU(2)$-representations using Fox's $p$-colorability.

math.GT

Transformations of partial matchings

We consider partial matchings, which are finite graphs consisting of edges and vertices of degree zero or one. We consider transformations between two states of partial matchings. We introduce a method of presenting a transformation between partial matchings. We introduce the notion of the lattice presentation of a partial matching, and the lattice polytope associated with a pair of lattice presentations, and we investigate transformations with minimal area.

math.GT

Simplifying branched covering surface-knots by chart moves involving black vertices

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 graph called a chart on a surface diagram of $F$. We can simplify a branched covering surface-knot by an addition of 1-handles with chart loops to a form such that its chart is the union of free edges and 1-handles with chart loops. We investigate properties of such simplifications for the case when branched covering surface-knots have a non-zero number of branch points, using chart moves involving black vertices.

math.GT

Simplifying branched covering surface-knots by an addition of 1-handles with chart loops

A branched covering surface-knot over an oriented surface-knot $F$ is a surface-knot in the form of a branched covering over $F$. A branched covering surface-knot over $F$ is presented by a graph called a chart on a surface diagram of $F$. For a branched covering surface-knot, an addition of 1-handles equipped with chart loops is a simplifying operation which deforms the chart to the form of the union of free edges and 1-handles with chart loops. We investigate properties of such simplifications.

math.GT

On addition of 1-handles with chart loops to 2-dimensional braids

A 2-dimensional braid over an oriented surface-knot $F$ is presented by a graph called a chart on a surface diagram of $F$. We consider 2-dimensional braids obtained by an addition of 1-handles equipped with chart loops. We introduce moves of 1-handles with chart loops, called 1-handle moves, and we investigate how much we can simplify a 2-dimensional braid by using 1-handle moves. Further, we show that an addition of 1-handles with chart loops is an unbraiding operation.

math.GT

Showing distinctness of surface links by taking 2-dimensional braids

For an oriented surface link $S$, we can take a satellite construction called a 2-dimensional braid over $S$, which is a surface link in the form of a covering over $S$. We demonstrate that 2-dimensional braids over surface links are useful for showing the distinctness of surface links. We investigate non-trivial examples of surface links with free abelian group of rank two, concluding that their link types are infinitely many.

math.GT

Satellites of an oriented surface link and their local moves

For an oriented surface link $F$ in $\mathbb{R}^4$, we consider a satellite construction of a surface link, called a 2-dimensional braid over $F$, which is in the form of a covering over $F$. We introduce the notion of an $m$-chart on a surface diagram $π(F)\subset \mathbb{R}^3$ of $F$, which is a finite graph on $π(F)$ satisfying certain conditions and is an extended notion of an $m$-chart on a 2-disk presenting a surface braid. A 2-dimensional braid over $F$ is presented by an $m$-chart on $π(F)$. It is known that two surface links are equivalent if and only if their surface diagrams are related by a finite sequence of ambient isotopies of $\mathbb{R}^3$ and local moves called Roseman moves. We show that Roseman moves for surface diagrams with $m$-charts can be well-defined.

math.GT

Unknotting numbers and triple point cancelling numbers of torus-covering knots

It is known that any surface knot can be transformed to an unknotted surface knot or a surface knot which has a diagram with no triple points by a finite number of 1-handle additions. The minimum number of such 1-handles is called the unknotting number or the triple point cancelling number, respectively. In this paper, we give upper bounds and lower bounds of unknotting numbers and triple point cancelling numbers of torus-covering knots, which are surface knots in the form of coverings over the standard torus $T$. Upper bounds are given by using $m$-charts on $T$ presenting torus-covering knots, and lower bounds are given by using quandle colorings and quandle cocycle invariants.

math.GT

Surface links with free abelian link groups

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 link groups is a free abelian group of rank three or four. Concerning the $T^2$-links of rank three, we determine the triple point numbers and we see that their link types are infinitely many.

math.GT

Unknotting surface links which are coverings of a trivial torus knot

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 cases, we can determine the unknotting numbers.

math.GT

Triple linking numbers and triple point numbers of certain $T^2$-links

The triple linking number of an oriented surface link was defined as an analogical notion of the linking number of a classical link. We consider a certain $m$-component $T^2$-link ($m \geq 3$) determined from two commutative pure $m$-braids $a$ and $b$. We present the triple linking number of such a $T^2$-link, by using the linking numbers of the closures of $a$ and $b$. This gives a lower bound of the triple point number. In some cases, we can determine the triple point numbers, each of which is a multiple of four.

math.GT