Related papers: Ordering the braid groups
Global results are proved about the way in which Boyland's forcing partial order organizes a set of braid types: those of periodic orbits of Smale's horseshoe map for which the associated train track is a star. This is a special case of a…
We show thatthe double reversing algorithm proposed by dehornoy for solving the word problem in the braid group can also be used to recognize the conjugates of powers of the generators in an Artin group of spherical type. The proof uses a…
We provide an infinite family of left-ordered groups, all of which have a positive cone that is finitely generated as a semigroup. This family includes the Klein bottle group and the braid group B_3.
We describe Artin's braid group on a (fixed) finite number of strings as a crossed module over itself. In particular, we interpret the braid relations as crossed module structure relations.
The Burns-Hale theorem states that a group G is left-orderable if and only if G is locally projectable onto the class of left-orderable groups. Similar results have appeared in the literature in the case of UPP groups and Conradian…
We give a new criterion which guarantees that a free group admits a bi-ordering that is invariant under a given automorphism. As an application, we show that the fundamental group of the "magic manifold" is bi-orderable, answering a…
We propose a criterion for preserving the regularity of a formal language representation when passing from groups to subgroups. We use this criterion to show that the regularity of a positive cone language in a left-orderable group passes…
Some curious structural similarities between a recent braid- and Hurwitz algebraic description of the unbroken internal symmetries for a single generations of Standard Model fermions were recently identified. The non-trivial braid groups…
It is well known that a countable group admits a left-invariant total order if and only if it acts faithfully on R by orientation preserving homeomorphisms. Such group actions are special cases of group actions on simply connected…
We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy problem, including the Dynnikov method, which could be especially…
A large class of positive finite presentations of the braid groups is found and studied. It is shown that no presentations but known exceptions in this class have the property that equivalent braid words are also equivalent under positive…
We describe pure braided versions of Thompson's group F. These groups, $BF$ and $\hat{BF}$, are subgroups of the braided versions of Thompson's group V, introduced by Brin and Dehornoy. Unlike V, elements of F are order-preserving self-maps…
Braid combing is a procedure defined by Emil Artin to solve the word problem in braid groups for the first time. It is well-known to have exponential complexity. In this paper, we use the theory of straight line programs to give a…
One of the most interesting questions about a group is if its word problem can be solved and how. The word problem in the braid group is of particular interest to topologists, algebraists and geometers, and is the target of intensive…
In the 1920's Artin defined the braid group in an attempt to understand knots in a more algebraic setting. A braid is a certain arrangement of strings in three-dimensional space. It is a celebrated theorem of Alexander that every knot is…
It is a conjecture that the signature of a positive link is bounded below by an increasing function of its negated Euler characteristic. In relation to this conjecture, we apply the generator description for canonical genus to show that the…
We introduce a partial order on the set of all reduced words of a given permutation $\omega$, called \emph{directed-braid poset} of $\omega$. This poset enables us to produce two algorithms: One is a sorting algorithm applied on any reduced…
We generalize presentations of the fundamental group of discriminant complements and arrive at a class of presentations associated naturally with words in the free monoid of the alphabet $\sigma_1,\dots,\sigma_{n-1}$. Our study addresses…
We provide an alternative proof of a sufficient condition for the fundamental group of the $n^{th}$ cyclic branched cover of $S^3$ along a prime knot $K$ to be left-orderable, which is originally due to Boyer-Gordon-Watson. As an…
We produce an explicit description of the K-theory and K-homology of the pure braid group on $n$ strands. We describe the Baum--Connes correspondence between the generators of the left- and right-hand sides for $n=4$. Using functoriality of…