• Corpus ID: 117106161

Graph products of groups

  title={Graph products of groups},
  author={Eli R. Green},
In the 1970's Baudisch introduced the idea of the semifree group, that is, a group in which the only relators are commutators of generators. Baudisch was mainly concerned with subgroup problems, employing length arguments on the elements of these groups. More recently Droms and Servatius have continued the study of semifree, or graph groups, as they call them. They answer some of the questions left open by the work of Baudisch. It is possible to take the graph analogy a level higher and study… 

Centralizers in graph products of semigroups

The first author of this article together with Gould studied the closure properties of graph products of monoids with respect to abundancy and Fountanicity (which may be viewed as weaker forms of

On the Diophantine problem in some one-relator groups

. We study the Diophantine problem, i.e. the decision problem of solving systems of equations, for some families of one-relator groups, and provide some background for why this problem is of

Generalising some results about right-angled Artin groups to graph products of groups

Limit groups over partially commutative groups and group actions on real cubings

The study of limit groups, that is, finitely generated fully residually free groups, was a key first step towards the understanding of the elementary theory of a free group. In this paper we conduct

Conjugacy growth series of groups

In this thesis we study the conjugacy growth series of several group constructions in terms of the standard and the conjugacy growth series of the building groups, with a specific generating set.

Automorphisms of graph products of groups and acylindrical hyperbolicity.

This article is dedicated to the study of the acylindrical hyperbolicity of automorphism groups of graph products of groups. Our main result is that, if $\Gamma$ is a finite graph which contains at

On graph products of monoids

Extensions of free groups: algebraic, geometric, and algorithmic aspects

In this work we use geometric techniques in order to study certain natural extensions of free groups, and solve several algorithmic problems on them. To this end, we consider the family of

Automorphisms of graph products of groups from a geometric perspective

This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those

On Subgroups of the Pentagon Group

Given a graph Γ with vertex set X, the graph group of Γ, denoted by G(Γ), is the group generated by the elements of X subject to the relations xy = yx for each pair x and y of adjacent vertices in Γ.



Combinatorial Group Theory

Chapter I. Free Groups and Their Subgroups 1. Introduction 2. Nielsen's Method 3. Subgroups of Free Groups 4. Automorphisms of Free Groups 5. Stabilizers in Aut(F) 6. Equations over Groups 7.

A residual property of certain groups

An element a of a group G is called conjugacy dis- tinguished or c.d. in G if and only if given any element b of G either a is conjugate to b or there is a homomorphism t from G onto a finite group H

Conjugacy separability of certain free products with amalgamation

Let G be a group. An element g of G is called conjugacy distinguished or c.d. in G if and only if given any element h of G either h is conjugate to g or there is a homomorphism e from G onto a finite

Residual solvability of an equation in nilpotent groups

Let G be a finitely generated nilpotent group. Let S, and S2 be subgroups of G. Let S^ be the set of all products g^, where g, is an element of Sr Let g be an element of G. It is shown that either g

Isomorphisms of graph groups

Given a graph X, define the presentation PX to have generators the vertices of X, and a relation xy = yx for each pair x, y of adjacent vertices. Let GX be the group with presentation PX, and given a

An extension of the Freiheitssatz

Let I be a set and let H(i) (i ∈ I) be non-trivial groups. If J is a subset of I, we denote the free product of the H(j) (j∈J) by H(J). We denote H(I) simply by H. Let R be a cyclically reduced

On pairs of 2-complexes and systems of equations over groups.

A System of m equations over a group G is conjectured to have a solution in some overgroup of G, provided its exponent-sum matrix has rank m. Using topological methods, the problem is shown to depend

Separating conjugates in amalgamated free products and HNN extensions

  • J. Dyer
  • Mathematics
    Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
  • 1980
Abstract A group G is termed conjugacy separable (c.s.) if any pair of distinct conjugacy classes may be mapped to distinct conjugacy classes in some finite epimorph of G. The free product of A and B

Finiteness conditions for CW complexes. Il

  • C. Wall
  • Mathematics
    Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences
  • 1966
A CW complex is a topological space which is built up in an inductive way by a process of attaching cells. Spaces homotopy equivalent to CW complexes play a fundamental role in topology. In the