Related papers: Groups of $\mathrm{I}_G$-type

We introduce and investigate the ribbon groupoid associated with a Garside group. Under a technical hypothesis, we prove that this category is a Garside groupoid. We decompose this groupoid into a semi-direct product of two of its parabolic…

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…

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…

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…

We study the large-scale geometry of graph braid groups $\mathbb{B}_n(\mathsf{\Gamma})$, viewed as the fundamental groups of discrete configuration spaces $UD_n(\mathsf{\Gamma})$, which are special cube complexes in the sense of…

Given a finite graph G there is a corresponding group given by the presentation with generators the vertices of G and a relation [x,y]=1 for generators x and y precisely when (x,y) is an edge of G. Such groups are known as partially…

Motivated by some alternatives to the classical logical model of boolean algebra, this paper deals with algebraic structures which extend skew lattices by locally invertible elements. Following the meme of the Ehresmann-Schein-Nambooripad…

The $G$-graph $\Gamma(G,S)$ is a graph from the group $G$ generated by $S\subseteq G$, where the vertices are the right cosets of the cyclic subgroups $\langle s \rangle, s\in S$ with $k$-edges between two distinct cosets if there is an…

In this paper, we give a Groebner-Shirshov basis of the braid group $B_{n+1}$ in the Artin--Garside generators. As results, we obtain a new algorithm for getting the Garside normal form, and a new proof that the braid semigroup $B^+{n+1}$…

We provide an explicit construction that allows one to easily decompose a graph braid group as a graph of groups. This allows us to compute the braid groups of a wide range of graphs, as well as providing two general criteria for a graph…

We characterize twisted right-angled Artin groups whose finitely generated subgroups are also twisted right-angled Artin groups. Additionally, we give a classification of coherence within this class of groups in terms of the defining graph.…

We define geodesic normal forms for the general series of complex reflection groups G(e,e,n). This requires the elaboration of a combinatorial technique in order to explicitly determine minimal word representatives of the elements of…

The main goal of this note is to suggest an algebraic approach to the quasi-isometric classification of partially commutative groups (alias right-angled Artin groups). More precisely, we conjecture that if the partially commutative groups…

This is a draft of a book submitted for publication by the AMS. Its theme is the remarkable interplay, accelerating in the last few decades, between topology and the theory of orderable groups, with applications in both directions. It…

A left orderable completely metrizable topological group is exhibited containing Artin's braid group on infinitely many strands. The group is the mapping class group (rel boundary) of the closed unit disk with a sequence of interior…

The Garside group, as a generalization of braid groups and Artin groups of finite types, is defined as the group of fractions of a Garside monoid. We show that the semidirect product of Garside monoids is a Garside monoid. We use the…

We prove that an arbitrary right-angled Artin group $G$ admits a quasi-isometric group embedding into a right-angled Artin group defined by the opposite graph of a tree. Consequently, $G$ admits quasi-isometric group embeddings into a pure…

For a finite group $G$, we define the inclusion graph of subgroups of $G$, denoted by $\mathcal I(G)$, is a graph having all the proper subgroups of $G$ as its vertices and two distinct vertices $H$ and $K$ in $\mathcal I(G)$ are adjacent…

We construct an embedding of any right-angled Artin group $G(\Delta)$ defined by a graph $\Delta$ into a graph braid group. The number of strands required for the braid group is equal to the chromatic number of $\Delta$. This construction…

We introduce a Dehornoy-like ordering of groups, which is a generalization of the Dehornoy ordering of the braid groups. Under a weak assumption which we call Property F, we show that Dehornoy-like orderings have properties similar to the…