Related papers: Biautomatic structures in systolic Artin groups
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…
The result of this paper is the determination of the cohomology of Artin groups of type A_n, B_n and \tilde{A}_{n} with non-trivial local coefficients. The main result is an explicit computation of the cohomology of the Artin group of type…
We show that each of the Artin groups of type $B_n$ and $D_n$ can be presented as a semidirect product $F \rtimes {\cal B}_n$, where $F$ is a free group and ${\cal B}_n$ is the $n$-string braid group. We explain how these semidirect product…
Define a Garside monoid to be a cancellative monoid where right and left lcm's exist and that satisfy additional finiteness assumptions, and a Garside group to be the group of fractions of a Garside monoid. The family of Garside groups…
We give a necessary and sufficient condition for a graph to have a right-angled Artin group as its braid group for braid index $\ge 5$. In order to have the necessity part, graphs are organized into small classes so that one of homological…
This chapter aims to provide a clear and understandable picture of constructive semigroups with apartness in Bishop's style of constructive mathematics, BISH. Our theory is partly inspired by the classical case, but it is distinguished from…
In this paper we define a way to get a bounded invertible automaton starting from a finite graph. It turns out that the corresponding automaton group is regular weakly branch over its commutator subgroup, contains a free semigroup on two…
We give criteria for deciding whether or not a triangle-free simple graph is the presentation graph of a right-angled Coxeter group that is quasiisometric to some right-angled Artin group, and, if so, producing a presentation graph for such…
We show that the simple elements of the dual Garside structure of an Artin group of type $D_n$ are Mikado braids, giving a positive answer to a conjecture of Digne and the second author. To this end, we use an embedding of the Artin group…
By introducing branching conditions on the defining graph, we prove a range of rigidity results for quasiisometric embeddings between right-angled Artin groups. The starting point for these is that, under mild conditions on the codomain,…
It is shown that a Yang-Baxter system can be constructed from any entwining structure. It is also shown that, conversely, Yang-Baxter systems of certain type lead to entwining structures. Examples of Yang-Baxter systems associated to…
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…
For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…
We prove the Tits Alternative for groups acting on $2$-dimensional "recurrent" complexes with uniformly bounded cell stabilisers. This class of complexes includes, among others: $2$-dimensional Euclidean buildings, $2$-dimensional systolic…
We construct a CAT(0) hierarchically hyperbolic group (HHG) acting geometrically on the product of a hyperbolic plane and a locally-finite tree which is not biautomatic. This gives the first example of an HHG which is not biautomatic, the…
The purpose of this note is make Theorem 13 in the article "On Biautomaticity of Non-Homogenous Small-Cancellation Groups" more accessible. Restatements of the theorem already appeared in few of the authors' succeeding works but with no…
A method of constructing a class of bihamiltonian structures is presented. Elements of this class are generalizations of the so-called bihamiltonian structures of general position on odd-dimensional manifolds. The method consists in a…
We construct automata over a binary alphabet with $2n$ states, $n\geq 2$, whose states freely generate a free group of rank $2n$. Combined with previous work, this shows that a free group of every finite rank can be generated by finite…
We show that a topological symplectic manifold has a canonically associated bi-Lipschitz structure. As a corollary, we obtain the first examples of non-existence and non-uniqueness for topological symplectic structures. Our arguments hold…
We show that a structural matrix algebra $A$ is isomorphic to the endomorphism algebra of an algebraic-combinatorial object called a generalized flag. If the flag is equipped with a group grading, an algebra grading is induced on $A$. We…