Characterization of Finite Type String Link

نویسنده

  • AKIRA YASUHARA
چکیده

In this paper, we 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 closure of (cabled) string links. We show that finite type invariants classify string links up to Ck-moves for k ≤ 5, which proves, at low degree, a conjecture due to Goussarov and Habiro. We also give a similar characterization of finite type concordance invariants of degree < 6.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : 0 90 4 . 15 27 v 1 [ m at h . G T ] 9 A pr 2 00 9 CHARACTERIZATION OF FINITE TYPE STRING LINK INVARIANTS OF DEGREE < 5

In this paper, we 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 closure of (cabled) string links. We show that finite type invariants classify string links up to Ck-moves for k ≤ 5, which proves, at low degree, a conjecture due to Goussar...

متن کامل

Tree Diagrams for String Links

In previous work [7], the author defined the intersection graph of a chord diagram associated with a string link (as in the theory of finite type invariants). In this paper, we classify the trees which can be obtained as intersection graphs of string link diagrams.

متن کامل

Maximum Allowable Dynamic Load of Flexible 2-Link Mobile Manipulators Using Finite Element Approach

In this paper a general formulation for finding the maximum allowable dynamic load (MADL) of flexible link mobile manipulators is presented. The main constraints used for the algorithm presented are the actuator torque capacity and the limited error bound for the end-effector during motion on the given trajectory. The precision constraint is taken into account with two boundary lines in plane w...

متن کامل

Burau Representation and Random Walks on String Links

Using a probabilistic interpretation of the Burau representation of the braid group offered by Vaughan Jones, we generalize the Burau representation to a representation of the semigroup of string links. This representation is determined by a linear system, and is dominated by finite type string link invariants. For positive string links, the representation matrix can be interpreted as the trans...

متن کامل

OD-characterization of $S_4(4)$ and its group of automorphisms

Let $G$ be a finite group and $pi(G)$ be the set of all prime divisors of $|G|$. The prime graph of $G$ is a simple graph $Gamma(G)$ with vertex set $pi(G)$ and two distinct vertices $p$ and $q$ in $pi(G)$ are adjacent by an edge if an only if $G$ has an element of order $pq$. In this case, we write $psim q$. Let $|G= p_1^{alpha_1}cdot p_2^{alpha_2}cdots p_k^{alpha_k}$, where $p_1

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010