An algorithm to classify rational 3-tangles

نویسندگان

چکیده

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

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

منابع مشابه

Classifying and Applying Rational Knots and Rational Tangles

In this survey paper we sketch new combinatorial proofs of the classification of rational tangles and of unoriented and oriented rational knots, using the classification of alternating knots and the calculus of continued fractions. We continue with the classification of achiral and strongly invertible rational links, and we conclude with a description of the relationships among tangles, rationa...

متن کامل

On the classification of rational tangles

In this paper we give two new combinatorial proofs of the classification of rational tangles using the calculus of continued fractions. One proof uses the classification of alternating knots. The other proof uses colorings of tangles. We also obtain an elementary proof that alternating rational tangles have minimal number of crossings. Rational tangles form a basis for the classification of kno...

متن کامل

Rational Tangles and the Modular Group

There is a natural way to define an isomorphism between the group of transformations of isotopy classes of rational tangles and the modular group. This isomorphism allows to give a simple proof of the Conway theorem, stating the one-to-one correspondence between isotopy classes of rational tangles and rational numbers. Two other simple ways to define this isomorphism, one of which suggested by ...

متن کامل

Training Radial Basis Function Neural Network using Stochastic Fractal Search Algorithm to Classify Sonar Dataset

Radial Basis Function Neural Networks (RBF NNs) are one of the most applicable NNs in the classification of real targets. Despite the use of recursive methods and gradient descent for training RBF NNs, classification improper accuracy, failing to local minimum and low-convergence speed are defects of this type of network. In order to overcome these defects, heuristic and meta-heuristic algorith...

متن کامل

From 3-moves to Lagrangian tangles and cubic skein modules

We present an expanded version of four talks describing recent developments in Knot Theory to which the author contributed. We discuss several open problems in classical Knot Theory and we develop techniques that allow us to study them: Lagrangian tangles, skein modules and Burnside groups. The method of Burnside groups of links was discovered and developed only half a year after the last talk ...

متن کامل

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


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

ژورنال

عنوان ژورنال: Journal of Knot Theory and Its Ramifications

سال: 2015

ISSN: 0218-2165,1793-6527

DOI: 10.1142/s0218216515500042