Coxeter groups are of central importance in several areas of algebra, geometry, and
combinatorics. This clear and rigorous exposition focuses on the combinatorial aspects of …

We compute explicitly the automorphism and outer automorphism group of all large-type
free-of-infinity Artin groups. Our strategy involves reconstructing the associated Deligne …

We show that the fundamental groups of any two closed irreducible nongeometric graph
manifolds are quasi-isometric. We also classify the quasi-isometry types of fundamental …

This article studies the structure of the automorphism groups of general graph products of
groups. We give a complete characterisation of the automorphisms that preserve the set of …

We prove that Whitehead's algorithm for solving the automorphism problem in a fixed free
group F k has strongly linear time generic-case complexity. This is done by showing that the …

In this article, we study homomorphisms between Artin groups that belong to two generic
classes. For XL-type Artin groups over complete graphs, we describe all possible …

We show that the class of large‐type Artin groups is invariant under isomorphism, in stark
contrast with the corresponding situation for Coxeter groups. We obtain this result by …

We compute the automorphism group of the intersection graph of many large-type Artin
groups. This graph is an analogue of the curve graph of mapping class groups but in the …

A Coxeter system is an ordered pair (W, S) where S is the generating set in a particular type
of presentation for the Coxeter group W. A subgroup of W is called special if it is generated …

We provide a necessary and sufficient condition on an element of a finite Coxeter group to
ensure the transitivity of the Hurwitz action on its set of reduced decompositions into …