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 of the symmetric inverse semigroup.
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 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.
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.
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 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.
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.
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 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.
Braid groups and mapping class groups have many features in common. Similarly to the notion of inverse braid monoid inverse mapping class monoid is defined. It concerns surfaces with punctures, but among given $n$ punctures several can be omitted. This corresponds to braids where the number of strings is not fixed. In the paper we give the analogue of the Dehn-Nilsen-Baer theorem, propose a presentation of the inverse mapping class monoid for a punctured sphere and study the word problem. This shows that certain properties and objects based on mapping class groups may be extended to the invers…
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}}.
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 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) …
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.
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.
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.
In this paper, we introduce PM-mapping class monoids. Braid groups and mapping class groups have many features in common. Similarly to the notion of braid PM-monoid, PM-mapping class monoid is defined. This construction is an analogy of inverse mapping class monoid defined by R. Karoui and V. V. Vershinin. As the main result, we give the analog of the Dehn-Nilsen-Baer theorem.
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…
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 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$.
The language of maximal lexicographic representatives of elements in the positive braid monoid $A_n$ with $n$ generators is a regular language. We describe with great detail the smallest Finite State Automaton accepting such language, and study the proportion of elements of length $k$ whose maximal lexicographic representative finishes with the first generator. This proportion tends to some number $P_{n,1}$, as $k$ tends to infinity, and we show that $P_{n,1}\geq \frac{1}{8}$ for every $n\geq 1$. We also provide an explicit formula, based on the Fibonacci numbers, for the number of states of t…
We construct certain monoids, called tied monoids. These monoids result to be semidirect products finitely presented and commonly built from braid groups and their relatives acting on monoids of set partitions. The nature of our monoids indicate that they should give origin to new knot algebras; indeed, our tied monoids include the tied braid monoid and the tied singular braid monoid, which were used, respectively, to construct new polynomial invariants for classical links and singular links. Consequently, we provide a mechanism to attach an algebra to each tied monoid. To build the tied monoi…
We study Artin-Tits braid groups $\mathbb{B}_W$ of type ADE via the action of $\mathbb{B}_W$ on the homotopy category $\mathcal{K}$ of graded projective zigzag modules (which categorifies the action of the Weyl group $W$ on the root lattice). Following Brav-Thomas, we define a metric on $\mathbb{B}_W$ induced by the canonical $t$-structure on $\mathcal{K}$, and prove that this metric on $\mathbb{B}_W$ agrees with the word-length metric in the canonical generators of the standard positive monoid $\mathbb{B}_W^+$ of the braid group. We also define, for each choice of a Coxeter element $c$ in $W$…
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.
We introduce methods to study the combinatorics of the normal form of large random elements in Artin-Tits monoids. These methods also apply in an axiomatic framework that encompasses other monoids such as dual braid monoids.
We present a new procedure to determine the growth function of a homogeneous Garside monoid, with respect to the finite generating set formed by the atoms. In particular, we present a formula for the growth function of each Artin--Tits monoid of spherical type (hence of each braid monoid) with respect to the standard generators, as the inverse of the determinant of a very simple matrix. Using this approach, we show that the exponential growth rates of the Artin--Tits monoids of type $A_n$ (positive braid monoids) tend to $3.233636\ldots$ as $n$ tends to infinity. This number is well-known, as …
The submonoid of the $3$-strand braid group $\mathcal{B}_3$ generated by $σ_1$ and $σ_1 σ_2$ is known to yield an exotic Garside structure on $\mathcal{B}_3$. We introduce and study an infinite family $(M_n)_{n\geq 1}$ of Garside monoids generalizing this exotic Garside structure, i.e., such that $M_2$ is isomorphic to the above monoid. The corresponding Garside group $G(M_n)$ is isomorphic to the $(n,n+1)$-torus knot group-which is isomorphic to $\mathcal{B}_3$ for $n=2$ and to the braid group of the exceptional complex reflection group $G_{12}$ for $n=3$. This yields a new Garside structure …
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 $σ_1,\dots,σ_{n-1}$. Our study addresses invariance properties of these presentations and the presented groups under various operations on the words. In particular we prove that the group does only depend on the corresponding element in the positive braid monoid, and under mild hypotheses only on its conjugacy class in the braid group.
Several distinct Garside monoids having torus knot groups as groups of fractions are known. For $n,m\geq 2$ two coprime integers, we introduce a new Garside monoid $\mathcal{M}(n,m)$ having as Garside group the $(n,m)$-torus knot group, thereby generalizing to all torus knot groups a construction that we previously gave for the $(n,n+1)$-torus knot group. As a byproduct, we obtain new Garside structures for the braid groups of a few exceptional complex reflection groups of rank two. Analogous Garside structures are also constructed for a few additional braid groups of exceptional complex refle…
In connection with the emerging theory of Garside categories, we develop the notions of a left-Garside category and of a locally left-Garside monoid. In this framework, the connection between the self-distributivity law LD and braids amounts to the result that a certain category associated with LD is a left-Garside category, which projects onto the standard Garside category of braids. This approach leads to a realistic program for establishing the Embedding Conjecture of [Dehornoy, Braids and Self-distributivity, Birkhauser (2000), Chap. IX].
We give a presentation by generators and relations of a certain monoid generating a subgroup of index two in the group Aut(F_2) of automorphisms of the rank two free group F_2 and show that it can be realized as a monoid in the group B_4 of braids on four strings. In the second part we use Christoffel words to construct an explicit basis of F_2 lifting any given basis of the free abelian group Z^2. We further give an algorithm allowing to decide whether two elements of F_2 form a basis or not. We also show that, under suitable conditions, a basis has a unique conjugate consisting of two palind…
