Right-angled Artin groups and their subgroups are of great interest because of their geometric, combinatorial and algorithmic properties. It is convenient to define these groups using finite simplicial graphs. The isomorphism type of the group is uniquely determined by the graph. Moreover, many structural properties of right angled Artin groups can be expressed in terms of their defining graph. In this article we address the question of understanding the structure of a class of subgroups of right-angled Artin groups in terms of the graph. Bestvina and Brady, in their seminal work, identified studied these subgroups (now called Bestvina-Brady groups or Artin kernels) from finiteness conditions viewpoint. Unlike the right-angled Artin group...
AbstractIn the present work, we give necessary and sufficient conditions on the graph of a right-ang...
We prove a new version of the classical peak reduction theorem for automorphisms of free groups in t...
We define an operation on finite graphs, called co-contraction. Then we show that for any co-contrac...
A finite simple graph \G determines a right-angled Artin group G_\G, with one generator for each ver...
The purpose of this thesis is to study the automorphisms of right-angled Artin groups. Given a finit...
A right-angled Artin group is a group that admits a finite presentation where the only relations are...
The purpose of this thesis is to study the automorphisms of right-angled Artin groups. Given a finit...
The purpose of this thesis is to study the automorphisms of right-angled Artin groups. Given a finit...
Abstract. Recently, right-angled Artin groups have attracted much attention in geomet-ric group theo...
We study the outer automorphism group of a right‐angled Artin group AΓ with finite defining graph ...
We study the outer automorphism group of a right‐angled Artin group AΓ with finite defining graph ...
AbstractWe prove three results about the graph product G=G(Γ;Gv,v∈V(Γ)) of groups Gv over a graph Γ....
AbstractIn the present work, we give necessary and sufficient conditions on the graph of a right-ang...
We prove a new version of the classical peak reduction theorem for automorphisms of free groups in t...
A classical result of Schreier states that nontrivial finitely generated normal subgroups of free gr...
AbstractIn the present work, we give necessary and sufficient conditions on the graph of a right-ang...
We prove a new version of the classical peak reduction theorem for automorphisms of free groups in t...
We define an operation on finite graphs, called co-contraction. Then we show that for any co-contrac...
A finite simple graph \G determines a right-angled Artin group G_\G, with one generator for each ver...
The purpose of this thesis is to study the automorphisms of right-angled Artin groups. Given a finit...
A right-angled Artin group is a group that admits a finite presentation where the only relations are...
The purpose of this thesis is to study the automorphisms of right-angled Artin groups. Given a finit...
The purpose of this thesis is to study the automorphisms of right-angled Artin groups. Given a finit...
Abstract. Recently, right-angled Artin groups have attracted much attention in geomet-ric group theo...
We study the outer automorphism group of a right‐angled Artin group AΓ with finite defining graph ...
We study the outer automorphism group of a right‐angled Artin group AΓ with finite defining graph ...
AbstractWe prove three results about the graph product G=G(Γ;Gv,v∈V(Γ)) of groups Gv over a graph Γ....
AbstractIn the present work, we give necessary and sufficient conditions on the graph of a right-ang...
We prove a new version of the classical peak reduction theorem for automorphisms of free groups in t...
A classical result of Schreier states that nontrivial finitely generated normal subgroups of free gr...
AbstractIn the present work, we give necessary and sufficient conditions on the graph of a right-ang...
We prove a new version of the classical peak reduction theorem for automorphisms of free groups in t...
We define an operation on finite graphs, called co-contraction. Then we show that for any co-contrac...