2011
DOI: 10.1007/s11856-011-0148-8
|View full text |Cite
|
Sign up to set email alerts
|

The generation of the augmentation ideal in profinite groups

Abstract: We find a formula for computing the minimum number of generators for the augmentation ideal in the profinite setting; this is a generalisation of a result obtained in the finite case by Cossey, Gruenberg and Kovács.We then consider probabilistic questions connected with the generation of the augmentation ideal and we define the class of APFG groups as those profinite groups for which the probability of generating the augmentation ideal with t random elements is non-zero for some t ∈ N. We give a characterisati… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 20 publications
0
5
0
Order By: Relevance
“…Clearly, G is not finitely generated, as d(G) ≥ d(G * p i ,n i ) ≥ n i and the integers n i tend to infinity. Since G is soluble, by [11,Corollary 2.4] and the remark after it, it must not have type FP 1 .…”
Section: 1mentioning
confidence: 93%
See 2 more Smart Citations
“…Clearly, G is not finitely generated, as d(G) ≥ d(G * p i ,n i ) ≥ n i and the integers n i tend to infinity. Since G is soluble, by [11,Corollary 2.4] and the remark after it, it must not have type FP 1 .…”
Section: 1mentioning
confidence: 93%
“…It is interesting to compare this result with the equivalent condition for PFG given in [22,Theorem 11.1(3)], which is expressed entirely in terms of sizes of the crown-based powers of monolithic groups with non-abelian minimal normal subgroup which appear as quotients of G. On the other hand, the minimum number of generators for a profinite group can be determined by the crown-based powers of all monolithic primitive groups which appear as quotients of G (see [11,Lemma 4.2]).…”
Section: Type Fpmentioning
confidence: 99%
See 1 more Smart Citation
“…On the other hand, the following example shows that a group in L HẐF need not be countably based even if it is of type FP 1 . This example is adapted from [5,Example 2.6]; the approach is the same, but we construct groups which are not countably based.…”
Section: Pro-discrete R-modulesmentioning
confidence: 99%
“…The existence of a group of type FP 1 over Ẑ that is not finitely generated is shown in [5,Example 2.6]. (c) Let π be a set of primes.…”
Section: Profinite Group Homology and Cohomology Over Direct Systemsmentioning
confidence: 99%