Automatic calculation of minimum crossing numbers of 3-braids
APPLIED MATHEMATICS AND COMPUTATION, cilt.144, sa.2-3, ss.507-516, 2003 (SCI-Expanded, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 144 Sayı: 2-3
- Basım Tarihi: 2003
- Doi Numarası: 10.1016/s0096-3003(02)00425-3
- Dergi Adı: APPLIED MATHEMATICS AND COMPUTATION
- Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
- Sayfa Sayıları: ss.507-516
- Ondokuz Mayıs Üniversitesi Adresli: Hayır
Özet
In this paper, we have given a computer program to calculate minimum crossing number provide a measure of complexity for braids. The computer program uses Berger algorithm which uses Artin braid word B of minimal length. Given a braid on N strings, the program generates an Artin braid word to minimal length. The length of an Artin word equals the number of crossing seen in a braid diagram. In this paper we have applied the program for 3-braids and given an example. (C) 2002 Elsevier Inc. All rights reserved.