scholarly journals Large normal subgroup growth and large characteristic subgroup growth

2020 ◽  
Vol 23 (1) ◽  
pp. 1-15
Author(s):  
Yiftach Barnea ◽  
Jan-Christoph Schlage-Puchta

AbstractThe fastest normal subgroup growth type of a finitely generated group is {n^{\log n}}. Very little is known about groups with this type of growth. In particular, the following is a long standing problem: Let Γ be a group and Δ a subgroup of finite index. Suppose Δ has normal subgroup growth of type {n^{\log n}}. Does Γ have normal subgroup growth of type {n^{\log n}}? We give a positive answer in some cases, generalizing a result of Müller and the second author and a result of Gerdau. For instance, suppose G is a profinite group and H an open subgroup of G. We show that if H is a generalized Golod–Shafarevich group, then G has normal subgroup growth of type {n^{\log n}}. We also use our methods to show that one can find a group with characteristic subgroup growth of type {n^{\log n}}.

Author(s):  
J. C. Lennox

We recall from (3) that a group G is (centrally) eremitic if there exists a positive integer e such that, whenever an element of G has some power in a centralizer, it has its eth power. The eccentricity of an eremitic group G is the least such positive integer e.In ((4), Theorem A) we proved that if A is a torsion free Abelian normal subgroup of a finitely generated group G with G/A nilpotent, then G has a subgroup of finite index with eccentricity 1. In this note we use a much simpler method to prove a stronger result.


1995 ◽  
Vol 38 (2) ◽  
pp. 177-181 ◽  
Author(s):  
Mario Curzio ◽  
C. Kanta Gupta

AbstractWe give a complete description of the second Fox subgroup G ∩ (1 + Δ2(G)Δ(H)) relative to a given normal subgroup H of an arbitrary finitely generated group G.


1976 ◽  
Vol 28 (6) ◽  
pp. 1302-1310 ◽  
Author(s):  
Brian Hartley

In [1], Bachmuth and Mochizuki conjecture, by analogy with a celebrated result of Tits on linear groups [8], that a finitely generated group of automorphisms of a finitely generated soluble group either contains a soluble subgroup of finite index (which may of course be taken to be normal) or contains a non-abelian free subgroup. They point out that their conjecture holds for nilpotent-by-abelian groups and in some other cases.


2019 ◽  
Vol 22 (3) ◽  
pp. 383-395
Author(s):  
Murray Elder ◽  
Cameron Rogers

Abstract For each symmetric, aperiodic probability measure μ on a finitely generated group G, we define a subset {A_{\mu}} consisting of group elements g for which the limit of the ratio {{\mu^{\ast n}(g)}/{\mu^{\ast n}(e)}} tends to 1. We prove that {A_{\mu}} is a subgroup, is amenable, contains every finite normal subgroup, and {G=A_{\mu}} if and only if G is amenable. For non-amenable groups we show that {A_{\mu}} is not always a normal subgroup and can depend on the measure. We formulate some conjectures relating {A_{\mu}} to the amenable radical.


2012 ◽  
Vol 22 (05) ◽  
pp. 1250048 ◽  
Author(s):  
MARTIN R. BRIDSON ◽  
JOSÉ BURILLO ◽  
MURRAY ELDER ◽  
ZORAN ŠUNIĆ

This paper records some observations concerning geodesic growth functions. If a nilpotent group is not virtually cyclic then it has exponential geodesic growth with respect to all finite generating sets. On the other hand, if a finitely generated group G has an element whose normal closure is abelian and of finite index, then G has a finite generating set with respect to which the geodesic growth is polynomial (this includes all virtually cyclic groups).


1993 ◽  
Vol 03 (04) ◽  
pp. 575-581 ◽  
Author(s):  
MARTIN R. BRIDSON ◽  
ROBERT H. GILMAN

It is currently unknown whether or not there exist (synchronously) combable groups which are not automatic. This note settles an analogous question in a simpler context. The notion of a broomlike combing is introduced. It is shown that if a group admits a broomlike combing then it admits a broomlike combing in which the language of combing words is regular. A finitely generated group admits a broomlike combing if and only if it contains a free subgroup of finite index.


1977 ◽  
Vol 20 (1) ◽  
pp. 33-34
Author(s):  
James Boler

Our purpose is to deduce from a theorem of P. Hall the following observation.Let G be a finitely generated group and F a free normal subgroup of G with G/F nilpotent. Then G is hopfian.Here a group G is hopfian if every epiendomorphism G→G is an automorphism.


2017 ◽  
Vol 27 (03) ◽  
pp. 299-314
Author(s):  
Oleg Bogopolski ◽  
Kai-Uwe Bux

Suppose that a finitely generated group [Formula: see text] is hyperbolic relative to a collection of subgroups [Formula: see text]. Let [Formula: see text] be subgroups of [Formula: see text] such that [Formula: see text] is relatively quasiconvex with respect to [Formula: see text] and [Formula: see text] is not parabolic. Suppose that [Formula: see text] is elementwise conjugate into [Formula: see text]. Then there exists a finite index subgroup of [Formula: see text] which is conjugate into [Formula: see text]. The minimal length of the conjugator can be estimated. In the case, where [Formula: see text] is a limit group, it is sufficient to assume only that [Formula: see text] is a finitely generated and [Formula: see text] is an arbitrary subgroup of [Formula: see text].


2004 ◽  
Vol 03 (02) ◽  
pp. 169-179 ◽  
Author(s):  
LEONID A. KURDACHENKO ◽  
IGOR YA. SUBBOTIN

We describe FC-hypercentral locally soluble groups G such that a groups algebra DG over a Dedekind domain D has a noetherian module A with faithful action of G such that A is subdirectly reducible and every proper factor module of A is finitely generated over D. It is proved, in particular, that G has an abelian normal subgroup of finite index.


Author(s):  
Rita Gitik

AbstractLet N be a finitely generated normal subgroup of a finitely generated group G. We show that if the trivial subgroup is tame in the factor group G/N, then N is that in G. We also give a short new proof of the fact that quasiconvex subgroups of negatively curved groups are tame. The proof utilizes the concept of the geodesic core of the subgroup and is related to the Dehn algorithm.


Sign in / Sign up

Export Citation Format

Share Document