相关论文: Loose ear decompositions and their applications to…

We determine when certain natural classes of subgroups of right-angled Coxeter groups (RACGs) and right-angled Artin groups (RAAGs) are themselves RAAGs. We characterize finite-index visual RAAG subgroups of 2-dimensional RACGs. As an…

We study Artin kernels, i.e. kernels of discrete characters of right-angled Artin groups, and we show that they decompose as graphs of groups in a way that can be explicitly computed from the underlying graph. When the underlying graph is…

We characterize twisted right-angled Artin groups (T-RAAGs) that are subgroup separable using only their defining mixed graphs: such a group is subgroup separable if and only if the underlying simplicial graph contains neither induced paths…

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…

Let $\mathcal{C}$ be a class of finite groups closed under taking subgroups, quotients, and extensions with abelian kernel. The right-angled Artin pro-$\mathcal{C}$ group $G_\Gamma$ (pro-$\mathcal{C}$ RAAG for short) is the…

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…

In this paper we study the elementary theory of graph products of groups and show that under natural conditions on the vertex groups we can recover (the core of) the underlying graph and the associated vertex groups. More precisely, we…

Using abelian coverings of Salvetti complexes, embeddings of outer automorphism groups of right-angled Artin groups (RAAGs) into outer automorphism groups of their particular characteristic subgroups are constructed. Virtual embeddings of…

We characterize, in terms of the defining graph, when a twisted right-angled Artin group (a group whose only relations among pairs of generators are either commuting or Klein-bottle type relations) is left-orderable.

It has long been known that the combinatorial properties of a graph $\Gamma$ are closely related to the group theoretic properties of its right angled artin group (raag). It's natural to ask if the graph homomorphisms are similarly related…

We give a geometric characterisation of those groups that arise as fixed subgroups of finite-order untwisted automorphisms of right-angled Artin groups (RAAGs). They are precisely the fundamental groups of a class of compact special cube…

We prove that the conjugacy problem in right-angled Artin groups (RAAGs), as well as in a large and natural class of subgroups of RAAGs, can be solved in linear-time. This class of subgroups contains, for instance, all graph braid groups…

In this paper we consider several classical and novel algorithmic problems for right-angled Artin groups, some of which are closely related to graph theoretic problems, and study their computational complexity. We study these problems with…

We propose the systematic study of presentations that can be generalised over a continuous open group monomorphism. Presentations with this property can turn well-known presentations such as those for as orientable surface groups, Artin…

We explicitly construct an embedding of a right-angled Artin group into a classical pure braid group. Using this we obtain a number of corollaries describing embeddings of arbitrary Artin groups into right-angled Artin groups and linearly…

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.…

Bidirected graphs (earlier studied by Edmonds, Johnson and, in equivalent terms of skew-symmetric graphs, by Tutte, Goldberg, Karzanov, and others) proved to be a useful unifying language for describing both flow and matching problems. In…

A nontrivial connected graph is matching covered if each edge belongs to some perfect matching. For most problems pertaining to perfect matchings, one may restrict attention to matching covered graphs; thus, there is extensive literature on…

We classify two-dimensional right-angled Coxeter groups that are quasiisometric to a right-angled Artin group defined by a tree, and show that when this is true the right-angled Coxeter group actually contains a visible finite index…

We investigate the minimal genus problem for the second homology of a right angled Artin group (RAAG). Firstly, we present a lower bound for the minimal genus of a second homology class, equal to half the rank of the corresponding cap…