scholarly journals Classification of string links up to 2n-moves and link-homotopy

2021 ◽  
pp. 1-23
Author(s):  
Haruko A. Miyazawa ◽  
Kodai Wada ◽  
Akira Yasuhara
Keyword(s):  
2018 ◽  
Vol 27 (13) ◽  
pp. 1842012
Author(s):  
Sergey A. Melikhov

We use Kirk’s invariant of link maps [Formula: see text] and its variations due to Koschorke and Kirk–Livingston to deduce results about classical links. Namely, we give a new proof of the Nakanishi–Ohyama classification of two-component links in [Formula: see text] up to [Formula: see text]-link homotopy. We also prove its version for string links, which is due (in a slightly different form) to Fleming–Yasuhara. The proofs do not use Clasper Theory.


1999 ◽  
Vol 08 (06) ◽  
pp. 773-787 ◽  
Author(s):  
BLAKE MELLOR

In [2], Bar-Natan used unitrivalent diagrams to show that finite type invariants classify string links up to homotopy. In this paper, I will construct the correct spaces of chord diagrams and unitrivalent diagrams for links up to homotopy. I will use these spaces to show that, far from classifying links up to homotopy, the only rational finite type invariants of link homotopy are the linking numbers of the components.


1990 ◽  
Vol 3 (2) ◽  
pp. 389-389 ◽  
Author(s):  
Nathan Habegger ◽  
Xiao-Song Lin
Keyword(s):  

Author(s):  
Benjamin Audoux ◽  
Paolo Bellingeri ◽  
Jean-Baptiste Meilhan ◽  
Emmanuel Wagner

2010 ◽  
Vol 148 (3) ◽  
pp. 439-472 ◽  
Author(s):  
JEAN-BAPTISTE MEILHAN ◽  
AKIRA YASUHARA

AbstractWe give a complete set of finite type string link invariants of degree <5. In addition to Milnor invariants, these include several string link invariants constructed by evaluating knot invariants on certain closures of (cabled) string links. We show that finite type invariants classify string links up toCk-moves fork≤ 5, which proves, at low degree, a conjecture due to Goussarov and Habiro. We also give a similar classification of string links up toCk-moves and concordance fork≤ 6.


2020 ◽  
Vol 29 (01) ◽  
pp. 2050002
Author(s):  
R. Komendarczyk ◽  
A. Michaelides

This paper concerns the tree invariants of string links, introduced by Kravchenko and Polyak, which are closely related to the classical Milnor linking numbers also known as [Formula: see text]-invariants. We prove that, analogously as for [Formula: see text]-invariants, certain residue classes of tree invariants yield link-homotopy invariants of closed links. The proof is arrow diagramatic and provides a more geometric insight into the indeterminacy through certain tree stacking operations. Further, we show that the indeterminacy of tree invariants is consistent with the original Milnor’s indeterminacy. For practical purposes, we also provide a recursive procedure for computing arrow polynomials of tree invariants.


1966 ◽  
Vol 24 ◽  
pp. 21-23
Author(s):  
Y. Fujita

We have investigated the spectrograms (dispersion: 8Å/mm) in the photographic infrared region fromλ7500 toλ9000 of some carbon stars obtained by the coudé spectrograph of the 74-inch reflector attached to the Okayama Astrophysical Observatory. The names of the stars investigated are listed in Table 1.


Sign in / Sign up

Export Citation Format

Share Document