相关论文: The dual braid monoid

We present a new algorithm to solve the conjugacy problem in Artin braid groups, which is faster than the one presented by Birman, Ko and Lee. This algorithm can be applied not only to braid groups, but to all Garside groups (which include…

We study parabolic double cosets in a Coxeter system by decomposing them into atom(ic coset)s, a generalization of simple reflections introduced in a joint work with Elias, Libedinsky, Patimo. We define and classify braid relations between…

In this doctoral thesis, we will determine the image of Artin groups associated to all finite irreducible Coxeter groups inside their associated finite Iwahori-Hecke algebra. This was done in type $A$ by Brunat, Magaard and Marin. The…

In this note we first consider a ternary matrix group related to the von Neumann regular semigroups and to the Artin braid group (in an algebraic way). The product of a special kind of ternary matrices (idempotent and of finite order)…

Let W be a Weyl group whose type is a simply laced Dynkin diagram. On several W-orbits of sets of mutually commuting reflections, a poset is described which plays a role in linear representatons of the corresponding Artin group A. The poset…

We investigate a new lattice of generalised non-crossing partitions, constructed using the geometry of the complex reflection group $G(e,e,r)$. For the particular case $e=2$ (resp. $r=2$), our lattice coincides with the lattice of simple…

We reduce the $K(\pi,1)$-conjecture for all Artin groups with tree Coxeter diagrams to properties of Artin groups with tripod-shaped Coxeter diagrams. Combining this reduction theorem and properties of braid groups in previous works of…

We derive functional relationships between spherical generating functions of graph monoids, right-angled Artin groups and right-angled Coxeter groups. We use these relationships to express the spherical generating function of a right-angled…

We propose a slight weakening of the definitions of Artin monoids and Coxeter monoids. We study one `infinite series' in detail.

This article is a survey on the braid groups, the Artin groups, and the Garside groups. It is a presentation, accessible to non-experts, of various topological and algebraic aspects of these groups. It is also a report on three points of…

We extend the theory of dual Coxeter and Artin groups to all rank-three Coxeter systems, beyond the previously studied spherical and affine cases. Using geometric, combinatorial, and topological techniques, we show that rank-three…

We give a computational algorithm which decides if a braid is quasipositive or not. A braid is quasipositive if it's a product of conjuguates of generators. For this, we use the theory of Garside and the combinatorials properties of the…

We construct a class of Garside groupoid structures on the pure braid groups, one for each function (called labelling) from the punctures to the integers greater than 1. The object set of the groupoid is the set of ball decompositions of…

This article is about Artin's braid group and its role in knot theory. We set ourselves two goals: (i) to provide enough of the essential background so that our review would be accessible to graduate students, and (ii) to focus on those…

Artin groups are a natural generalization of braid groups and are well-understood in certain cases. Artin groups are closely related to Coxeter groups. There is a faithful representation of a Coxeter group $W$ as a linear reflection group…

We describe a simple scheme for constructing finitely generated monoids in which left-divisibility is a linear ordering and for practically investigating these monoids. The approach is based on subword reversing, a general method of…

We initiate the study of C*-algebras and groupoids arising from left regular representations of Garside categories, a notion which originated from the study of Braid groups. Every higher rank graph is a Garside category in a natural way. We…

We describe new combinatorial methods for constructing an explicit free resolution of Z by ZG-modules when G is a group of fractions of a monoid where enough least common multiples exist (``locally Gaussian monoid''), and, therefore, for…

We study a specific line arrangement obtained from a generic $2$-section of the braid arrangement, and compute the fundamental group of its complement via braid monodromy. We show that the resulting presentation of the fundamental group…

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.