Efficient solutions to the braid isotopy problem
Texte intégral
Documents relatifs
However, many natural questions about word reversing remain open, even in the basic case of the standard presentation of Artin’s braid group B n. There are two types of word
Technically, our main contribution is the following result, which gives a partial affirmative answer (in the special case of pseudo-Anosov 4-strand braids) to the Open Question 2
In this sense Theorem 4.4 gives an anolog of Dynnikov coordinates originally defined for braid groups.
The antistairs are given by step 2, the stairs by step 4, and the rest of the canonical form is obtained by applying the algorithm to the matrix A !.. See figure 16 for
The equality problem is decidable, in the endomorphism monoid of any sub- shift with computable language (for instance 1D sofic subshift, 1D substitu- tive subshift, minimal
We propose two families of greedy algorithms for solving MSCP, and suggest improvements to the two greedy algorithms most often referred to in the literature for solving the
Firstly, the case where system (1) is linearly observable is analyzed. This means that the corresponding observer may be designed on the basis of the linear residue. Secondly,
Consider the greedy walk algorithm from the previous section and denote again by N g the point process of all removed points.. In this more general setting, we may formulate a number