ON THE SUBGROUP SEPARABILITY OF THE FUNDAMENTAL GROUP OF A FINITE GRAPH OF GROUPS

1996 ◽  
Vol 29 (1) ◽  
Author(s):  
E. Raptis ◽  
D. Varsos
Keyword(s):  
Fundamental Group ◽  
Finite Graph ◽  
Graph Of Groups ◽  
Subgroup Separability

FIXED POINTS OF SYMMETRIC ENDOMORPHISMS OF GROUPS

2002 ◽  
Vol 12 (05) ◽  
pp. 737-745 ◽  
Author(s):  
MIHALIS SYKIOTIS
Keyword(s):  
Fundamental Group ◽  
Fixed Points ◽  
Structure Theorem ◽  
Graph Of Groups

Let G be the fundamental group of a graph of groups with finite edge groups and f an endomorphism of G. We prove a structure theorem for the subgroup Fix(f), which consists of the elements of G fixed by f, in the case where the endomorphism f of G maps vertex groups into conjugates of themselves.

THE COMBINATION THEOREM AND QUASICONVEXITY

2001 ◽  
Vol 11 (02) ◽  
pp. 185-216 ◽  
Author(s):  
ILYA KAPOVICH
Keyword(s):  
Fundamental Group ◽  
Isometric Embedding ◽  
Normal Forms ◽  
Vertex Group ◽  
Graph Of Groups

We show that if G is a fundamental group of a finite k-acylindrical graph of groups where every vertex group is word-hyperbolic and where every edge-monomorphism is a quasi-isometric embedding, then all the vertex groups are quasiconvex in G (the group G is word-hyperbolic by the Combination Theorem of M. Bestvina and M. Feighn). This allows one, in particular, to approximate the word metric on G by normal forms for this graph of groups.

scholarly journals The fundamental group of a locally finite graph with ends

2011 ◽  
Vol 226 (3) ◽  
pp. 2643-2675 ◽  
Author(s):  
Reinhard Diestel ◽  
Philipp Sprüssel
Keyword(s):  
Fundamental Group ◽  
Finite Graph ◽  
Locally Finite ◽  
Locally Finite Graph

scholarly journals Isometric embeddings in bounded cohomology

2014 ◽  
Vol 06 (01) ◽  
pp. 1-25 ◽  
Author(s):  
M. Bucher ◽  
M. Burger ◽  
R. Frigerio ◽  
A. Iozzi ◽  
C. Pagliantini ◽  
...  
Keyword(s):  
Fundamental Group ◽  
Isometric Embedding ◽  
Equivalence Theorem ◽  
Connected Component ◽  
Bounded Cohomology ◽  
Graph Of Groups ◽  
Simplicial Volume ◽  
Direct Sum ◽  
Isometric Embeddings ◽  
Relative Bounded Cohomology

This paper is devoted to the construction of norm-preserving maps between bounded cohomology groups. For a graph of groups with amenable edge groups, we construct an isometric embedding of the direct sum of the bounded cohomology of the vertex groups in the bounded cohomology of the fundamental group of the graph of groups. With a similar technique we prove that if (X, Y) is a pair of CW-complexes and the fundamental group of each connected component of Y is amenable, the isomorphism between the relative bounded cohomology of (X, Y) and the bounded cohomology of X in degree at least 2 is isometric. As an application we provide easy and self-contained proofs of Gromov's Equivalence Theorem and of the additivity of the simplicial volume with respect to gluings along π1-injective boundary components with amenable fundamental group.

ON RESIDUAL FINITENESS OF GRAPHS OF NILPOTENT GROUPS

2004 ◽  
Vol 14 (04) ◽  
pp. 403-408
Author(s):  
E. RAPTIS ◽  
O. TALELLI ◽  
D. VARSOS
Keyword(s):  
Finite Groups ◽  
Finite Graph ◽  
Nilpotent Groups ◽  
Fundamental Groups ◽  
Residual Finiteness ◽  
Graph Of Groups ◽  
Residually Finite ◽  
Edge Group ◽  
Residually Finite Groups ◽  
Torsion Free

Here we characterize the residually finite groups G which are the fundamental groups of a finite graph of finitely generated torsion-free nilpotent groups. Namely we show that G is residually finite if and only if for each edge group of the graph of groups the two edge monomorphisms differ essentially by an isomorphism of certain subgroups of the Mal'cev completion of the corresponding vertex groups.

scholarly journals A combination theorem for affine tree-free groups

2016 ◽  
Vol 26 (07) ◽  
pp. 1283-1321
Author(s):  
Shane O. Rourke
Keyword(s):  
Abelian Group ◽  
Fundamental Group ◽  
Large Class ◽  
Recent Work ◽  
Isometric Action ◽  
Graph Of Groups ◽  
Finitely Generated Group ◽  
Affine Action ◽  
Relatively Hyperbolic ◽  
Solvable Word

Let [Formula: see text] be an ordered abelian group. We show how a group admitting a free affine action without inversions on a [Formula: see text]-tree admits a natural graph of groups decomposition, where vertex groups inherit actions on [Formula: see text]-trees. We introduce a stronger condition (essential freeness) on an affine action and apply recent work of various authors to deduce that a finitely generated group admitting an essentially free affine action on a [Formula: see text]-tree is relatively hyperbolic with nilpotent parabolics, is locally relatively quasiconvex, and has solvable word, conjugacy and isomorphism problems. Conversely, given a graph of groups satisfying certain conditions, we show how an affine action of its fundamental group can be constructed. Specialising to the case of free affine actions, we obtain a large class of groups that have a free affine action on a [Formula: see text]-tree but that do not act freely by isometries on any [Formula: see text]-tree. We also give an example of a group that admits a free isometric action on a [Formula: see text]-tree but which is not residually nilpotent.

scholarly journals AUTOMATIC STRUCTURES AND BOUNDARIES FOR GRAPHS OF GROUPS

1994 ◽  
Vol 04 (04) ◽  
pp. 591-616 ◽  
Author(s):  
WALTER D. NEUMANN ◽  
MICHAEL SHAPIRO
Keyword(s):  
Fundamental Group ◽  
Equivalence Relation ◽  
Infinite Product ◽  
Graph Product ◽  
Graph Of Groups ◽  
Automatic Structures ◽  
Graphs Of Groups ◽  
Underlying Graph ◽  
Edge Group ◽  
Labelled Graphs

We study the synchronous and asynchronous automatic structures on the fundamental group of a graph of groups in which each edge group is finite. Up to a natural equivalence relation, the set of biautomatic structures on such a graph product bijects to the product of the sets of biautomatic structures on the vertex groups. The set of automatic structures is much richer. Indeed, it is dense in the infinite product of the sets of automatic structures of all conjugates of the vertex groups. We classify these structures by a class of labelled graphs which “mimic” the underlying graph of the graph of groups. Analogous statements hold for asynchronous automatic structures. We also discuss the boundaries of these structures.

scholarly journals The Farrell-Jones isomorphism conjecture for 3-manifold groups

2007 ◽  
Vol 1 (1) ◽  
pp. 49-82 ◽  
Author(s):  
S.K. Roushon
Keyword(s):  
Fundamental Group ◽  
Large Class ◽  
Partial Solution ◽  
Fundamental Groups ◽  
Problem List ◽  
Index Subgroup ◽  
Main Aspect ◽  
Graph Of Groups ◽  
Genus 2 ◽  
Finite Index Subgroup

AbstractWe show that the Fibered Isomorphism Conjecture (FIC) of Farrell and Jones corresponding to the stable topological pseudoisotopy functor is true for fundamental groups of a large class of 3-manifolds. We also prove that if the FIC is true for irreducible 3-manifold groups then it is true for all 3-manifold groups. In fact, this follows from a more general result we prove, namely we show that if the FIC is true for each vertex group of a graph of groups with trivial edge groups then the FIC is true for the fundamental group of the graph of groups. This result is part of a program to prove the FIC for the fundamental group of a graph of groups where all the vertex and edge groups satisfy the FIC. A consequence of the first result gives a partial solution to a problem in the problem list of R. Kirby. We also deduce that the FIC is true for a class of virtually P D3-groups.Another main aspect of this article is to prove the FIC for all Haken 3-manifold groups assuming that the FIC is true for B-groups. By definition a B-group contains a finite index subgroup isomorphic to the fundamental group of a compact irreducible 3-manifold with incompressible nonempty boundary so that each boundary component is of genus ≥ 2. We also prove the FIC for a large class of B-groups and moreover, using a recent result of L.E. Jones we show that the surjective part of the FIC is true for any B-group.

Sign in / Sign up

Export Citation Format

Share Document