کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4659778 1344336 2012 15 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Computing the Conway polynomial of several closures of oriented 3-braids
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات هندسه و توپولوژی
پیش نمایش صفحه اول مقاله
Computing the Conway polynomial of several closures of oriented 3-braids
چکیده انگلیسی

This paper deals with polynomial invariants of a class of oriented 3-string tangles and the knots (or links) obtained by applying six different closures. In Cabrera-Ibarra (2004) [1], expressions were given to compute the Conway polynomials of four different closures of the composition of two such 3-string tangles. By using the expressions and results from that reference, and using an algorithm developed on the basis of Gillerʼs calculations for 3-string tangles, we provide new results concerning six closures of 3-braids. Surprisingly, for 3-braids two of the closures turn out to be affine functions of the four previously defined. Among the contributions in this paper one finds computational tools to obtain the Conway polynomial of closures of 3-braids in terms of continuous fractions and their expansions. An interesting feature is that our calculations yield explicit, nonrecursive formulas in the case of 3-braids, thereby considerably lowering the time required to compute them. As a byproduct, explicit expressions are also given to obtain both numerators and denominators of continuous fractions in a nonrecursive way.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Topology and its Applications - Volume 159, Issue 4, 1 March 2012, Pages 1195-1209