arXiv subjects

Atsuhiko Mizusawa

Publications and source records attributed to Atsuhiko Mizusawa.

10 recordsLinked to original sources

arXiv2026

Implementation of the Habegger--Lin decision algorithm

Habegger and Lin gave a classification of link-homotopy classes of links in terms of that of string links modulo certain group actions. As an application, they constructed an algorithm for determining whether given two links are link-homotopic. In \cite{KM4}, we explicitly computed these group actions for the 4- and 5-component cases. Consequently, the Habegger--Lin algorithm can be effectively applied in these cases. In this paper, we present an implementation of this algorithm, which is available at \cite{KMcode}, and exhibit new pairs of links that are not link-homotopic yet cannot be distinguished by Milnor's link-homotopy invariants, called $\overlineμ$-invariants.

math.GT↗

arXiv2023

Homotopy theories of colored links and spatial graphs

Two links are called link-homotopic if they are transformed to each other by a sequence of self-crossing changes and ambient isotopies. The notion of link-homotopy is generalized to spatial graphs and it is called component-homotopy. The link-homotopy classes were classified by Habegger and Lin through the classification of the link-homotopy classes of string links. In this paper, we classify colored string links up to colored link-homotopy by using the Habegger-Lin theory. Moreover, we classify colored links and spatial graphs up to colored link-homotopy and component-homotopy respectively.

math.GT↗

arXiv2023

Clasper presentations of Habegger-Lin's action on string links

Habegger and Lin gave a classification of the link-hmotopy classes of links as the link-homotopy classes of string links modulo the actions of conjugations and partial conjugations for string links. In this paper, we calculated the actions of the partial conjugations and the conjugations explicitly for 4- and 5-component string links which gave classifications (presentations) of the link-homotopy classes of 4- and 5-component links. As an application, we can run Habegger and Lin's algorithm which determines whether given two links are link-homotopoic or not for 4- and 5-component links.

math.GT↗

arXiv2020

Link-homotopy classes of 4-component links and claspers

Two links are link-homotopic if they are transformed into each other by a sequence of self-crossing changes and ambient isotopies. The link-homotopy classes of 4-component links were classified by Levine with enormous algebraic computations. We modify the results by using Habiro's clasper theory. The new classification gives more symmetrical and schematic points of view to the link-homotopy classes of 4-component links. As applications, we give several new subsets of the link-homotopy classes of 4-component links which are classified by comparable invariants and give an algorithm which determines whether given two links are link-homotopic or not.

math.GT↗

arXiv2016

HL-homotopy of handlebody-links and Milnor's invariants

A handlebody-link is a disjoint union of embeddings of handlebodies in $S^3$ and an HL-homotopy is an equivalence relation on handlebody-links generated by self-crossing changes. The second author and Ryo Nikkuni classified the set of HL-homotopy classes of 2-component handlebody-links completely using the linking numbers for handlebody-links. In this paper, we construct a family of invariants for HL-homotopy classes of general handlebody-links, by using Milnor's link-homotopy invariants. Moreover, we give a bijection between the set of HL-homotopy classes of almost trivial handlebody-links and tensor product space modulo some general linear actions, especially for 3- or more component handlebody-links. Through this bijection we construct comparable invariants of HL-homotopy classes.

math.GT↗

arXiv2016

A construction of smooth travel groupoids on finite graphs

A travel groupoid is an algebraic system related with graphs. In this paper, we give an algorithm to construct smooth travel groupoids for any finite graph. This algorithm gives an answer of L.~Nebesk$\acute{\mbox{y}}$'s question, "Does there exists a connected graph $G$ such that $G$ has no smooth travel groupoid?", in finite cases.

math.CO↗

arXiv2015

A homotopy classification of two-component spatial graphs up to neighborhood equivalence

A neighborhood homotopy is an equivalence relation on spatial graphs which is generated by crossing changes on the same component and neighborhood equivalence. We give a complete classification of all 2-component spatial graphs up to neighborhood homotopy by the elementary divisor of a linking matrix with respect to the first homology group of each of the connected components. This also leads a kind of homotopy classification of 2-component handlebody-links.

math.GT↗

arXiv2015

Yokota type invariants derived from non-integral highest weight representations of $U_q(sl_2)$

We define invariants for colored oriented spatial graphs by generalizing CM invariants, which were defined via non-integral highest weight representations of $U_q(sl_2)$. We apply the same method to define Yokota's invariants, and we call these invariants Yokota type invariants. Then we propose a volume conjecture of the Yokota type invariants of plane graphs which relates to volumes of hyperbolic polyhedra corresponding to the graphs, and check it numerically for some square pyramids and pentagonal pyramids.

math.GT↗

arXiv2013

Invariants of Handlebody-Knots via Yokota's Invariants

We construct quantum $\mathcal{U}_q(\mathfrak{sl}_{\,2})$ type invariants for handlebody-knots in the 3-sphere $S^3$. A handlebody-knot is an embedding of a handlebody in a 3-manifold. These invariants are linear sums of Yokota's invariants for colored spatial graphs which are defined by using the Kauffman bracket. We give a table of calculations of our invariants for genus 2 handlebody-knots up to six crossings. We also show our invariants are identified with special cases of the Witten-Reshetikhin-Turaev invariants.

math.GT↗

arXiv2013

Linking numbers for handlebody-links

As a generalization of the linking number, we construct a set of invariant numbers for two-component handlebody-links. These numbers are elementary divisors associated with the natural homomorphism from the first homology group of a component to that of the complement of another component.

math.GT↗