A Fast Method for Comparing Braids

@article{Dehornoy1997AFM,
  title={A Fast Method for Comparing Braids},
  author={Patrick Dehornoy},
  journal={Advances in Mathematics},
  year={1997},
  volume={125},
  pages={200-235}
}
Abstract We describe a new method for comparing braid words which relies both on the automatic structure of the braid groups and on the existence of a linear ordering on braids. This syntactical algorithm is a direct generalization of the classical words reduction used in the description of free groups, and is more efficient in practice than all previously known methods. 

Fast Algorithms for Identification and Comparison of Braids

A method for constructing algorithms solving the word and comparison problems for mapping class groups (in particular, for the braid group) is presented, and a family of one-side invariant orderings

CONVERGENCE OF HANDLE REDUCTION OF BRAIDS

We give a proof for the convergence of the handle reduction algorithm of braids that is both more simple and more precise than the ones of [2] or [3]. The prerequisites are Garside’s theory of

A new approach to the word and conjugacy problems in the braid groups

Abstract 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

A NEW DISTINGUISHED FORM FOR 3-BRAIDS

We show that every 3-strand braid has a representative word o f a given form, and furthermore, this form allows us, in most cases, to deduce po sitivity (or negativity) in the -ordering of B3. The

An algorithm for the word problem in braid groups

We suggest a new algorithm for finding a canonical representative of a given braid, and also for the harder problem of finding a $\sigma_1$-consistent representative. We conjecture that the algorithm

Representing Braids by Automorphisms

Based on a normal form for braid group elements suggested by Dehornoy, we prove several representations of braid groups by automorphisms of a free group to be faithful. This includes a simple proof

Braid lift representations of Artin's Braid Group

We recast the braid-lift representation of Contantinescu, Ludde and Toppan in the language of B-type braid theory. Composing with finite dimensional representations of these braid groups we obtain

A simple algorithm to compute link polynomials defined by using skein relations

  • Xuezhi Zhao
  • Mathematics
    Computational and Mathematical Biophysics
  • 2020
Abstract We give a simple and practical algorithm to compute the link polynomials, which are defined according to the skein relations. Our method is based on a new total order on the set of all braid
...

References

SHOWING 1-10 OF 22 REFERENCES

ALGORITHMS FOR POSITIVE BRAIDS

We give an easily handled algorithm for the word problem in each of Artin’s braid groups, Bn, based on Garside’s methods, but framed more directly in terms of the set of positive braids in which each

The theory of braids.

  • E. Artin
  • Mathematics
    American scientist
  • 1950
A theory of braids leading to a classification was given in my paper "Theorie der Zopfe" in vol. 4 of the Hamburger Abhandlungen (quoted as Z). Most of the proofs are entirely intuitive. That of the

FROM LARGE CARDINALS TO BRAIDS VIA DISTRIBUTIVE ALGEBRA

This text presents some recent developments in left distributive algebra induced by set theory and their applications to the combinatorics of braids mainly in terms of order properties and existence

Braid groups and left distributive operations

The decidability of the word problem for the free left distributive law is proved by introducing a structure group which describes the underlying identities. This group is closely connected with

Braids, Links, and Mapping Class Groups.

The central theme of this study is Artin's braid group and the many ways that the notion of a braid has proved to be important in low-dimensional topology. In Chapter 1 the author is concerned with

An isoperimetric inequality for Artin groups of finite type

We show that Artin groups of finite type satisfy a quadratic isoperimetric inequality. Moreover we describe an explicit algorithm to solve the word problem in quadratic time