Birman, Ko and Lee have introduced a new monoid ${\cal B}^{*}_{n}$--with an explicit presentation--whose group of fractions is the $n$-strand braid group ${\cal B}_{n}$. Building on a new approach by Digne, Michel and himself, Bessis has defined a {\it dual} braid monoid for every finite Coxeter type Artin-Tits group extending the type A case. Here, we give an explicit presentation for this dual braid monoid in the case of types B and D, and we study the combinatorics of the underlying Garside structures.
We describe the restriction of the Dehornoy ordering of braids to the dual braid monoids introduced by Birman, Ko and Lee: we give an inductive characterization of the ordering of the dual braid monoids and compute the corresponding ordinal type. The proof consists in introducing a new ordering on the dual braid monoid using the rotating normal form of arXiv:0811.3902 [math.GR], and then proving that this new ordering coincides with the standard ordering of braids.
We consider a natural generalization of braids which we call shrinking braids. We state the relations of shrinking braids and use them to define algebraically the monoid $R$. We endow a subset of $R$ with a \emph{left distributive monoid} structure and use it to extend the Dehornoy order on $B_{\infty}$ to an order on $R$. By using this order, we prove that $R$ is isomorphic to the monoid which is generated (geometrically) by shrinking braids.
We construct a quasi-Garside monoid structure for the free group. This monoid should be thought of as a dual braid monoid for the free group, generalising the constructions by Birman-Ko-Lee and by the author of new Garside monoids for Artin groups of spherical type. Conjecturally, an analog construction should be available for arbitrary Artin groups and for braid groups of well-generated complex reflection groups.
We construct a new monoid structure for Artin groups associated with finite Coxeter systems. This monoid shares with the classical positive braid monoid a crucial algebraic property: it is a Garside monoid. The analogy with the classical construction indicates there is a ``dual'' way of studying Coxeter systems, where the pair (W,S) is replaced by (W,T), with T the set of all reflections. In the type A case, we recover the monoid constructed by Birman-Ko-Lee
We study braid diagrams with a minimal number of crossings. Such braid diagrams correspond to geodesic words for the braid groups with standard Artin generators. We prove that a diagram of a homogeneous braid is minimal if and only if it is homogeneous. We conjecture that monoids of homogeneous braids are Artin-Tits monoids and prove that monoids of alternating braids are right-angled Artin monoids. Using this, we give a lower bound on the growth rate of the braid groups.
We describe new types of normal forms for braid monoids, Artin-Tits monoids, and, more generally, for all monoids in which divisibility has some convenient lattice properties (``locally Garside monoids''). We show that, in the case of braids, one of these normal forms coincides with the normal form introduced by Burckel and deduce that the latter can be computed easily. This approach leads to a new, simple description for the standard ordering (``Dehornoy order'') of Bn in terms of that of B(n-1), and to a quadratic upper bound for the complexity of this ordering.
For a finite Thurston type ordering < of the braid group B_{n}, we introduce a new normal form of a dual positive braid which we call the C-normal form. This normal form extends Fromentin's rotating normal form and the author's C-normal form of positive braids. Using the C-normal form, we give a combinatorial description of the restriction of the ordering < to the dual braid monoids B_{n}^{+*}. We prove that the restriction to the dual positive monoid (B_{n}^{+*},<) is a well-ordered set of order type ω^{ω^{n-2}}.
In his initial paper on braids E.Artin gave a presentation with two generators for an arbitrary braid group. We give analogues of this Artin's presentation for various generalizations of braids.
We obtain presentations for the Brauer monoid, the partial analogue of the Brauer monoid, and for the greatest factorizable inverse submonoid of the dual symmetric inverse monoid. In all three cases we apply the same approach, based on the realization of all these monoids as Brauer-type monoids.
In this paper, we shall introduce two monoids. One is called a PM-monoid which contains the symmetric group, the other is called a braid PM-monoid which contains the braid group. We shall develop the theory of PM-monoids and that of braid PM-monoids. The PM-monoids is obtained in the context of the compactification of projective linear group defined by Mutsumi Saito. The structure of PM-monoids is described in terms of matched pairs. We can define braid PM-monoid using a presentation for the PM-monoid. As main results, we show that braid PM-monoids are described by geometric braids and we find…
We give presentations for the braid groups associated with the complex reflection groups $G_{24}$ and $G_{27}$. For the cases of $G_{29}$, $G_{31}$, $G_{33}$ and $G_{34}$, we give (strongly supported) conjectures. These presentations were obtained with VKCURVE, a GAP package implementing Van Kampen's method.
We give new, short proofs of the presentations for the partition monoid and its singular ideal originally given in the author's 2011 papers in J Alg and IJAC.
The dual symmetric inverse monoid $\mathscr{I}_n^*$ is the inverse monoid of all isomorphisms between quotients of an $n$-set. We give a monoid presentation of $\mathscr{I}_n^*$ and, along the way, establish criteria for a monoid to be inverse when it is generated by completely regular elements.
Presentations are computed for a braided version BV of Thompson's group V and for V itself showing that there is an Artin group/Coxeter group relation between them. The presentation for V is obtained from that for BV by declaring all that all generators are involutions.
This paper proposes for every $n$, linear time reductions of the word and conjugacy problems on the braid groups $B_n$ to the corresponding problems on the braid monoids $B_n^+$ and moreover only using positive words representations.
The purpose of this paper is to introduce the theory of presentations of monoids acts. We aim to construct `nice' general presentations for various act constructions pertaining to subacts and Rees quotients. More precisely, given an $M$-act $A$ and a subact $B$ of $A$, on the one hand we construct presentations for $B$ and the Rees quotient $A/B$ using a presentation for $A$, and on the other hand we derive a presentation for $A$ from presentations for $B$ and $A/B$. We also construct a general presentation for the union of two subacts. From our general presentations, we deduce a number of fin…
Let G be a graph. The (unlabeled) configuration space of n points on G is the space of all n-element subsets of G. The fundamental group of such a configuration space is called a graph braid group. We use a version of discrete Morse theory to compute presentations of all graph braid groups, for all finite connected graphs G and all natural numbers n.
There are well known relations between braid groups and symmetric groups, between Artin-Briskorn braid groups and Coxeter groups. Inverse braid monoid the same way is related to the inverse symmetric monoid. In the paper we show that similar relations exist between the inverse braid monoid of type $B$ and the inverse reflection monoid of type $B$. This gives a presentation of the last monoid.
We study the way in which the abstract structure of a small overlap monoid is reflected in, and may be algorithmically deduced from, a small overlap presentation. We show that every C(2) monoid admits an essentially canonical C(2) presentation; by counting canonical presentations we obtain asymptotic estimates for the number of non-isomorphic monoids admitting a-generator, k-relation presentations of a given length. We demonstrate an algorithm to transform an arbitrary presentation for a C(m) monoid (m at least 2) into a canonical C(m) presentation, and a solution to the isomorphism problem fo…
We describe a formalism, using groupoids, for the study of rewriting for presentations of inverse monoids, that is based on the Squier complex construction for monoid presentations. We introduce the class of pseudoregular groupoids, an example of which now arises as the fundamental groupoid of our version of the Squier complex. A further key ingredient is the factorisation of the presentation map from a free inverse monoid as the composition of an idempotent pure map and an idempotent separating map. The relation module of a presentation is then defined as the abelianised kernel of this idempo…
We obtain a presentation for the singular part of the Brauer monoid with respect to an irreducible system of generators, consisting of idempotents. As an application of this result we get a new construction of the symmetric group via connected sequences of subsets. Another application describes the lengths of elements in the singular part of the Brauer monoid with respect to the system of generators, mentioned above.
In this survey we show how well known results about the Word Problem for finite group presentations can be generalized to the Word Problem and other decision problems for non-necessarily finite monoid and group presentations. This is done by introducing functions playing the same role of the Dehn function for the given decision problem and by finding the Tietze transformations that leave this function invariant. This survey presents some original ideas and points of view.
Garside's results and the existense of the greedy normal form for braids are shown to be true for the singular braid monoid. An analogue of the presentation of J. S. Birman, K. H. Ko and S. J. Lee for the braid group is also obtained for this monoid.
In this paper we show that the singular braid monoid of an orientable surface can be embedded in a group. The proof is purely topological, making no use of the monoid presentation.
We give presentations, in terms of generators and relations, for the monoids of singular braids on closed surfaces. The proof of the validity of these presentations can also be applied to verify, in a new way, the presentations given by Birman for the monoids of Singular Artin braids.
We describe a new presentation for the complex reflection groups of type $(e,e,r)$ and their braid groups. A diagram for this presentation is proposed. The presentation is a monoid presentation which is shown to give rise to a Garside structure. A detailed study of the combinatorics of this structure leads us to describe it as post-classical.
Inverse braid monoid describes a structure on braids where the number of strings is not fixed. So, some strings of initial $n$ may be deleted. In the paper we show that many properties and objects based on braid groups may be extended to the inverse braid monoids. Namely we prove an inclusion into a monoid of partial monomorphisms of a free group. This gives a solution of the word problem. Another solution is obtained by an approach similar to that of Garside. We give also the analogues of Artin presentation with two generators and Sergiescu graph-presentations.
Consider the unit ball, B = D x [0,1], containing n unknotted arcs a_1, ... a_n such that the boundary of each a_i lies in D x {0}. We give a finite presentation for the mapping class group of B fixing the arcs {a_1, ..., a_n} setwise and fixing D x {1} pointwise. This presentation is calculated using the action of this group on a simply-connected complex.
On the model of simple braids, defined to be the left divisors of Garside's elements $Δ\_n$ in the monoid $B\_\infty^+$ , we investigate simple elements in Thompson's monoid $F^+$ and in a larger monoid $H^+$ that is a hybrid of $B\_\infty^+$ and $F^+$ : in both cases, we count how many simple elements left divide the right lcm of the first n -- 1 atoms, and characterize their normal forms in terms of forbidden factors. In the case of $H^+$, a generalized Pascal triangle appears.
We provide new group presentations for surface braid groups which are positive. We study some properties of such presentations and we solve the conjugacy problem in a particular case.
We aim at studying the asymptotic properties of typical positive braids, respectively positive dual braids. Denoting by $μ_k$ the uniform distribution on positive (dual) braids of length $k$, we prove that the sequence $(μ_k)_k$ converges to a unique probability measure $μ_{\infty}$ on infinite positive (dual) braids. The key point is that the limiting measure $μ_{\infty}$ has a Markovian structure which can be described explicitly using the combinatorial properties of braids encapsulated in the Möbius polynomial. As a by-product, we settle a conjecture by Gebhardt and Tawn (J. Algebra, 2014) …
In this paper we discuss algebraic, combinatorial and topological properties of singular virtual braids. On the algebraic side we state the relations between classical and virtual singular objects, in addition we discuss a Birman-like conjecture for the virtual case. On the topological and combinatorial side, we prove that there is a bijection between singular abstract braids, horizontal Gauss diagrams and singular virtual braids, in particular using horizontal Gauss diagrams we obtain a presentation of the singular pure virtual braid monoid.
We give a solution to the word problem for the singular braid monoid SB_n. The complexity of the algorithm is quadratic in the product of the word length and the number of the singular generators in the word. Furthermore we algebraically reprove a result of Fenn, Keyman and Rourke that the monoid embeds into a group and we compute the cohomological dimension of this group.
We obtain new presentations for the imprimitive complex reflection groups of type $(de,e,r)$ and their braid groups $B(de,e,r)$ for $d,r \ge 2$. Diagrams for these presentations are proposed. The presentations have much in common with Coxeter presentations of real reflection groups. They are positive and homogeneous, and give rise to quasi-Garside structures. Diagram automorphisms correspond to group automorphisms. The new presentation shows how the braid group $B(de,e,r)$ is a semidirect product of the braid group of affine type $\widetilde A_{r-1}$ and an infinite cyclic group. Elements of $…
We state a conjecture about centralizers of certain roots of central elements in braid groups, and check it for Artin braid groups and some other cases. Our proof makes use of results by Birman-Ko-Lee; we give a new intrinsic account of these results.
A combinatorial property of prositive group presentations, called completeness, is introduced, with an effective criterion for recognizing complete presentations, and an iterative method for completing an incomplete presentation. We show how to directly read several properties of the associated monoid and group from a complete presentation: cancellativity or existence of common multiples in the case of the monoid, or isoperimetric inequality in the case of the group. In particular, we obtain a new criterion for recognizing that a monoid embeds in a group of fractions. Typical presentations eli…
The aim of this article is to prove that the kernel of the map from the pure braid group $PB_{n},n\ge 4$ to the group $G_{n}^{3}$ consists of full twist braids and their exponents. The proof consists of two parts. The first part which deals with $n=4$ relies on the crucial tool in this construction having its own interest is the {\em realisability projection} saying that if two {\em realisable} $G_{4}^{3}$-elements are equivalent then they are equivalent by a sequence of realisable ones. The second part (an easy one) uses induction on $n$.
We show how the categorial approach to inverse monoids can be described as a certain endofunctor (which we call the partialization functor) of some category. In this paper we show that this functor can be used to obtain several recently defined inverse monoids, and use it to define a new object, which we call the inverse braid-permutation monoid. A presentation for this monoid is obtained. Finally, we study some abstract properties of the partialization functor and its iterations. This leads to a categorification of a monoid of all order preserving maps, and series of orthodox generalizations …
In this paper we give new presentations of the braid groups and the pure braid groups of a closed surface. We also give an algorithm to solve the word problem in these groups, using the given presentations.
We will study the presentations of fundamental groups of the complement of complexified real affine line arrangements that do not contain two parallel lines. By Yoshinaga's minimal presentation, we can give positive homogeneous presentations of the fundamental groups. We consider the associated monoids defined by the presentations. It turns out that, in some cases, left (resp. right) \emph{least common multiple} does not always exist. Hence, the monoids are neither \emph{Garside} nor \emph{Artin}. Nevertheless, we will show that they carry certain particular elements similar to the \emph{funda…
In the paper we give a survey of rather new notions and results which generalize classical ones in the theory of braids. Among such notions are various inverse monoids of partial braids. We also observe presentations different from standard Artin presentation for generalizations of braids. Namely, we consider presentations with small number of generators, Sergiescu graph-presentations and Birman-Ko-Lee presentation. The work of V.V.Chaynikov on the word and conjugacy problems for the singular braid monoid in Birman-Ko-Lee generators is described as well.
This paper shows how to construct coherent presentations (presentations by generators, relations and relations among relations) of monoids admitting a right-noetherian Garside family. Thereby, it resolves the question of finding a unifying generalisation of the following two distinct extensions of construction of coherent presentations for spherical Artin-Tits monoids: to general Artin-Tits monoids, and to Garside monoids. The result is applied to some monoids which are neither Artin-Tits nor Garside.
We give several new positive finite presentations for the pure braid group that are easy to remember and simple in form. All of our presentations involve a metric on the punctured disc so that the punctures are arranged "convexly", which is why we describe them as geometric presentaitons. Motivated by a presentation for the full braid group that we call the "rotation presentation", we introduce presentations for the pure braid group that we call the "twist presentation" and the "swing presentation". From the point of view of mapping class groups, the swing presentation can be interpreted as st…
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 relations.
This is the second in a series of papers that develops the theory of reflection monoids, motivated by the theory of reflection groups. Reflection monoids were first introduced in arXiv:0812.2789. In this paper we study their presentations as abstract monoids. Along the way we also find general presentations for certain join-semilattices (as monoids under join) which we interpret for two special classes of examples: the face lattices of convex polytopes and the geometric lattices, particularly the intersection lattices of hyperplane arrangements. Another spin-off is a general presentation for t…
Let B_n be the Artin braid group on n strings with standard generators sigma_1, ..., sigma_{n-1}, and let SB_n be the singular braid monoid with generators sigma_1^{+-1}, ..., sigma_{n-1}^{+-1}, tau_1, ..., tau_{n-1}. The desingularization map is the multiplicative homomorphism eta: SB_n --> Z[B_n] defined by eta(sigma_i^{+-1}) =_i^{+-1} and eta(tau_i) = sigma_i - sigma_i^{-1}, for 1 <= i <= n-1. The purpose of the present paper is to prove Birman's conjecture, namely, that the desingularization map eta is injective.
We study the rational permutation braids, that is the elements of an Artin-Tits group of spherical type which can be written $x^{-1} y$ where $x$ and $y$ are prefixes of the Garside element of the braid monoid. We give a geometric characterization of these braids in type $A_n$ and $B_n$ and then show that in spherical types different from $D_n$ the simple elements of the dual braid monoid (for arbitrary choice of Coxeter element) embedded in the braid group are rational permutation braids (we conjecture this to hold also in type $D_n$).This property implies positivity properties of the polynom…
We describe presentations of braid groups of type $A$ arising from coloured quivers of mutation type $A$. We show that these can be interpreted geometrically as generalised triangulations of regular polygons.
We show that the Steinberg group $\text{St}(C_2,{\mathbb Z})$ associated with the Lie type $C_2$ and with integer coefficients can be realized as a quotient of the braid group $B_6$ by one relation. As an application we give a new braid-like presentation of the symplectic modular group $\text{Sp}_4({\mathbb Z})$.
We show that being finitely presentable and being finitely presentable with solvable word problem are quasi-isometry invariants of finitely generated left cancellative monoids. Our main tool is an elementary, but useful, geometric characterisation of finite presentability for left cancellative monoids. We also give examples to show that this characterisation does not extend to monoids in general, and indeed that properties such as solvable word problem are not isometry invariants for general monoids.
We obtain several presentations by generators and relations for the rook partition monoids and algebras, as well as their singular ideals. Among other results, we also calculate the minimal sizes of generating sets (some of our presentations use such minimal-size generating sets), and show that the singular part of the rook partition monoid is generated by its idempotents.
If G is a finite graph and n is a natural number, then the n-strand braid group of G is the fundamental group of the configuration space of n points on G. This article gives a complete computation of the integral cohomology rings of the n-strand braid groups in case G is a tree. Some of the argument builds on earlier joint work with Lucas Sabalka.
We derive a recurrence relation for the number of simple vertex-labelled bipartite graphs with given degrees of the vertices and use this result to obtain a new method for computing the growth function of the Artin monoid of type $A_{n-1}$ with respect to the simple elements (permutation braids) as generators. Instead of matrices of size $2^{n-1}\times 2^{n-1}$, we use matrices of size $p(n)\times p(n)$, where $p(n)$ is the number of partitions of $n$.
