✦ LIBER ✦

On braid words and irreflexivity

✍ Scribed by David M. Larue

Publisher: Springer
Year: 1994
Tongue: English
Weight: 365 KB
Volume: 31
Category: Article
ISSN: 0002-5240
DOI: 10.1007/bf01188182

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Note on Words in Braid Monoids

✍ Jean Michel 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 152 KB

Splitting words and Lorenz braids

✍ C. Tresser; R.F. Williams 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 546 KB

Sturmian morphisms, the braid groupB4, C

Sturmian morphisms, the braid groupB4, Christoffel words and bases ofF2

✍ Christian Kassel; Christophe Reutenauer 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 383 KB

On complexity of the word problem in bra

On complexity of the word problem in braid groups and mapping class groups

✍ Hessam Hamidi-Tehrani 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 350 KB

We prove that the word problem in the mapping class group of the once-punctured surface of genus g has complexity O(|w| 2 g) for |w| log(g) where |w| is the length of the word in a (standard) set of generators. The corresponding bound in the case of the closed surface is O(|w| 2 g 2 ). We also carry

On Braiding and Dyslexia

✍ B. Pareigis 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 488 KB

Braided monoidal categories have important applications in knot theory, algebraic quantum field theory, and the theory of quantum groups and Hopf algebras. We will construct a new class of braided monoidal categories. Typical examples of braided monoidal categories are the category of modules over a

A New Approach to the Word and Conjugacy

A New Approach to the Word and Conjugacy Problems in the Braid Groups

✍ Joan Birman; Ki Hyoung Ko; Sang Jin Lee 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 638 KB

A new presentation of the n-string braid group B n is studied. Using it, a new solution to the word problem in B n is obtained which retains most of the desirable features of the Garside Thurston solution, and at the same time makes possible certain computational improvements. We also give a related