On the number of infinite branches in the graph of all p-groups of coclass r (Q5718042)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2246684
Language Label Description Also known as
default for all languages
No label defined
    English
    On the number of infinite branches in the graph of all p-groups of coclass r
    scientific article; zbMATH DE number 2246684

      Statements

      On the number of infinite branches in the graph of all p-groups of coclass r (English)
      0 references
      0 references
      13 January 2006
      0 references
      finite \(p\)-groups
      0 references
      pro-\(p\)-groups of finite coclass
      0 references
      uniserial \(p\)-adic space groups
      0 references
      numbers of groups
      0 references
      The coclass conjectures of \textit{C.~R.~Leedham-Green} and \textit{M. F.~Newman} [Arch. Math. 35, 193-202 (1980; Zbl 0437.20016)] have been proved independently by \textit{C. R. Leedham-Green} [J. Lond. Math. Soc., II. Ser. 50, No. 1, 49-67 (1994; Zbl 0822.20018)] and \textit{A.~Shalev} [Invent. Math. 115, No. 2, 315-345 (1994; Zbl 0795.20009)]. As a result, it follows that given a prime \(p\) and an integer \(r>0\), there is a finite number \(f(p,r)\) of (isomorphism types of) infinite pro-\(p\)-groups of coclass \(r\). The values of \(f(p,r)\) were known so far only for small values of \(p\) and \(r\). The paper under review is concerned with asymptotic bounds for \(f(p,r)\). This is an important contribution, which sheds light on the complexity of \(f\). The main result is that there is a non-negative \(\varepsilon=\varepsilon(p,r)\) such that \[ p^{(1-\varepsilon)p^{r-1}}\leq f(p,r)\leq r^2p^{(1+\varepsilon)r^3p^{2(r-1)}}. \] As a side result, bounds for the number of the corresponding uniserial \(p\)-adic space groups are obtained.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references