scholarly journals Groups with a quotient that contains the original group as a direct factor

1992 ◽  
Vol 45 (3) ◽  
pp. 513-520 ◽  
Author(s):  
Ron Hirshon ◽  
David Meier

We prove that given a finitely generated group G with a homomorphism of G onto G × H, H non-trivial, or a finitely generated group G with a homomorphism of G onto G × G, we can always find normal subgroups N ≠ G such that G/N ≅ G/N × H or G/N ≅ G/N × G/N respectively. We also show that given a finitely presented non-Hopfian group U and a homomorphism φ of U onto U, which is not an isomorphism, we can always find a finitely presented group H ⊇ U and a finitely generated free group F such that φ induces a homomorphism of U * F onto (U * F) × H. Together with the results above this allows the construction of many examples of finitely generated groups G with G ≅ G × H where H is finitely presented. A finitely presented group G with a homomorphism of G onto G × G was first constructed by Baumslag and Miller. We use a slight generalisation of their method to obtain more examples of such groups.

1998 ◽  
Vol 08 (01) ◽  
pp. 23-34 ◽  
Author(s):  
Susan Garner Garille ◽  
John Meier

Let G be a finitely generated group. The Bieri–Neumann–Strebel invariant Σ1(G) of G determines, among other things, the distribution of finitely generated subgroups N◃G with G/N abelian. This invariant can be quite difficult to compute. Given a finite presentation 〈S:R〉 for G, there is an algorithm, introduced by Brown and extended by Bieri and Strebel, which determines a space Σ(R) that is always contained in, and is sometimes equal to, Σ1(G). We refine this algorithm to one which involves the local structure of the universal cover of the standard 2-complex of a given presentation. Let Ψ(R) denote the space determined by this algorithm. We show that Σ(R) ⊆ Ψ ⊆ Σ1(G) for any finitely presented group G, and if G admits a staggered presentation, then Ψ = Σ1(G). By casting this algorithm in terms of connectivity properties of graphs, it is shown to be computationally feasible.


1970 ◽  
Vol 22 (1) ◽  
pp. 176-184 ◽  
Author(s):  
Rex Dark ◽  
Akbar H. Rhemtulla

1.1. If a group satisfies the maximal condition for normal subgroups, then all its central factors are necessarily finitely generated. In [2], Hall asked whether there exist finitely generated soluble groups which do not satisfy the maximal condition for normal subgroups but all of whose central factors are finitely generated. We shall answer this question in the affirmative. We shall also construct a finitely generated group all of whose subnormal subgroups are perfect (and which therefore has no non-trivial central factors), but which does not satisfy the maximal condition for normal subgroups. Related to these examples is the question of which classes of finitely generated groups satisfy the maximal condition for normal subgroups. A characterization of such classes has been obtained by Hall, and we shall include his result as our first theorem.


1997 ◽  
Vol 56 (1) ◽  
pp. 17-24 ◽  
Author(s):  
Satya Deo ◽  
K. Varadarajan

The main results proved in this note are the following:(i) Any finitely generated group can be expressed as a quotient of a finitely presented, centreless group which is simultaneously Hopfian and co-Hopfian.(ii) There is no functorial imbedding of groups (respectively finitely generated groups) into Hopfian groups.(iii) We prove a result which implies in particular that if the double orientable cover N of a closed non-orientable aspherical manifold M has a co-Hopfian fundamental group then π1(M) itself is co-Hopfian.


1974 ◽  
Vol 18 (1) ◽  
pp. 41-53 ◽  
Author(s):  
William W. Boone ◽  
Graham Higman

The following theorem is the focal point of the present paper. It stipulates an algebraic condition equivalent, in any finitely generated group, to the solubility of the word problem.THEOREM I. A necessary and sufficient condition that a finitely generated group G have a soluble word problem is that there exist a simple group H, and a finitely presented group K, such that G is a subgroup of H, and H is a subgroup of K.


2016 ◽  
Vol 26 (03) ◽  
pp. 551-564
Author(s):  
Dessislava H. Kochloukova

We study when an abstract finitely presented group [Formula: see text] of cohomological dimension [Formula: see text] has pro-[Formula: see text] completion [Formula: see text] of cohomological dimension [Formula: see text]. Furthermore, we prove that for a tree hyperbolic limit group [Formula: see text] we have [Formula: see text] and show an example of a hyperbolic limit group [Formula: see text] that is not free and [Formula: see text] is free pro-[Formula: see text]. For a finitely generated residually free group [Formula: see text] that is not a limit group, we show that [Formula: see text] is not free pro-[Formula: see text].


2016 ◽  
Vol 28 (3) ◽  
pp. 457-471 ◽  
Author(s):  
ANDRÉ NIES ◽  
ANDREA SORBI

(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal co-computably enumerable equivalence relation. (3) Each c.e. truth-table degree contains the word problem of a finitely generated group of computable permutations.


1973 ◽  
Vol 16 (1) ◽  
pp. 98-110 ◽  
Author(s):  
Gilbert Baumslag

In 1961 Graham Higman [1] proved that a finitely generated group is a subgroup of a finitely presented group if, and only if, it is recursively presented. Therefore a finitely generated metabelian group can be embedded in a finitely presented group.


2011 ◽  
Vol 21 (04) ◽  
pp. 595-614 ◽  
Author(s):  
S. LIRIANO ◽  
S. MAJEWICZ

If G is a finitely generated group and A is an algebraic group, then RA(G) = Hom (G, A) is an algebraic variety. Define the "dimension sequence" of G over A as Pd(RA(G)) = (Nd(RA(G)), …, N0(RA(G))), where Ni(RA(G)) is the number of irreducible components of RA(G) of dimension i (0 ≤ i ≤ d) and d = Dim (RA(G)). We use this invariant in the study of groups and deduce various results. For instance, we prove the following: Theorem A.Let w be a nontrivial word in the commutator subgroup ofFn = 〈x1, …, xn〉, and letG = 〈x1, …, xn; w = 1〉. IfRSL(2, ℂ)(G)is an irreducible variety andV-1 = {ρ | ρ ∈ RSL(2, ℂ)(Fn), ρ(w) = -I} ≠ ∅, thenPd(RSL(2, ℂ)(G)) ≠ Pd(RPSL(2, ℂ)(G)). Theorem B.Let w be a nontrivial word in the free group on{x1, …, xn}with even exponent sum on each generator and exponent sum not equal to zero on at least one generator. SupposeG = 〈x1, …, xn; w = 1〉. IfRSL(2, ℂ)(G)is an irreducible variety, thenPd(RSL(2, ℂ)(G)) ≠ Pd(RPSL(2, ℂ)(G)). We also show that if G = 〈x1, . ., xn, y; W = yp〉, where p ≥ 1 and W is a word in Fn = 〈x1, …, xn〉, and A = PSL(2, ℂ), then Dim (RA(G)) = Max {3n, Dim (RA(G′)) +2 } ≤ 3n + 1 for G′ = 〈x1, …, xn; W = 1〉. Another one of our results is that if G is a torus knot group with presentation 〈x, y; xp = yt〉 then Pd(RSL(2, ℂ)(G))≠Pd(RPSL(2, ℂ)(G)).


Author(s):  
Sam Shepherd ◽  
Daniel J. Woodhouse

Abstract We study the quasi-isometric rigidity of a large family of finitely generated groups that split as graphs of groups with virtually free vertex groups and two-ended edge groups. Let G be a group that is one-ended, hyperbolic relative to virtually abelian subgroups, and has JSJ decomposition over two-ended subgroups containing only virtually free vertex groups that are not quadratically hanging. Our main result is that any group quasi-isometric to G is abstractly commensurable to G. In particular, our result applies to certain “generic” HNN extensions of a free group over cyclic subgroups.


Sign in / Sign up

Export Citation Format

Share Document