×

The groups and nilpotent Lie rings of order \(p^8\) with maximal class. (English) Zbl 07873971

Let \(p\) be a prime number an let \(f(p,n)\) be the number of isomorphism classes of groups of order \(p^{n}\). In 1960, G. Higman wrote two important papers [Proc. Lond. Math. Soc., III. Ser. 10, 24–30 (1960; Zbl 0093.02603); Proc. Lond. Math. Soc., III. Ser. 10, 566–582 (1960; Zbl 0201.36502)], in which he conjectured that \(f(p, n)\) is a PORC (\(\mathsf{P}\)olynomial \(\mathsf{O}\)n \(\mathsf{R}\)esidue \(\mathsf{C}\)lasses) function of \(p\) for each positive integer \(n\). A function on primes is PORC if and only if it is PORC on all but finitely many primes, because the finitely many primes can be incorporated by multiplying them with the modulus of the residue classes. Thus, the conjecture can be reformulated as stating that \(f(p,n)\) is a PORC function of \(p\) for all sufficiently large \(p\).
Higman’s PORC conjecture was proved for \(n \leq 7\) (for the case \(n=7\), see the paper of E. A. O’Brien and the second author [J. Algebra 292, No. 1, 243–258 (2005; Zbl 1108.20016)]). The reviewer points out that evidence was found in [M. du Sautoy and the second author, J. Algebra 361, 287–312 (2012; Zbl 1267.20025)] that the PORC conjecture is not valid for \(n \geq 10\).
Let \(m(p,n)\) be the number of groups of order \(p^{8}\) with maximal class. In the paper under review, the authors prove that \(m(p,n)\) is a PORC function for \(p \geq 11\). To do this, they first prove Theorem 1.1: For \(p \geq 5\) the number of nilpotent Lie rings of order \(p^{8}\) which have maximal class is \[ 4p^{3}+7p^{2}+9p+6+(6p+11)g_{3}+ 4g_{5}+(p+2)g_{7}+(p+3)g_{8}+2g_{9}+g_{12}, \] where \(g_{i}=\gcd(p-1,i)\). Therefore, they apply the Lazard correspondence [M. Lazard, Ann. Sci. Éc. Norm. Supér., III. Sér. 71, 101–190 (1954; Zbl 0055.25103)] between \(p\)-groups and nilpotent Lie rings.

MSC:

20D15 Finite nilpotent groups, \(p\)-groups
17B30 Solvable, nilpotent (super)algebras

Software:

GAP; LiePRing; Magma; LieRing

References:

[1] Bagnera, G. (1898). La composizione dei Gruppi finiti il cui grado è la quinta potenza di un numero primo. Ann. Mat. Pura Appl. 3(1): 137-228 doi: · JFM 29.0112.03
[2] Besche, H. U., Eick, B., O’Brien, E. A. (2002). A Millennium project: constructing small groups. Int. J. Algebra Comput.12: 623-644. doi: · Zbl 1020.20013
[3] Bosma, W., Cannon, J., Playoust, C. (1997). The Magma algebra system I: The user language. J. Symb. Comput., 24: 235-265. · Zbl 0898.68039
[4] Cicalò, S., de Graaf, W. (2019). LieRing - Computing with finitely presented Lie rings, a GAP 4 package.
[5] Eick, B., Vaughan-Lee, M. R. (2018). LiePRing - Database and algorithms for Lie p-rings, a GAP 4 package.
[6] Evseev, A. (2008). Higman’s PORC conjecture for a family of groups. Bull. Lond. Math. Soc. 40: 415-431 doi: · Zbl 1147.20014
[7] [The GAP Group. (2020). GAP - Groups, Algorithms, and Programming, Version 4.11. Available at http://www.gap-system.org.
[8] Higman, G. (1960). Enumerating p-groups. II. Problems whose solution is PORC. Proc. London Math. Soc. 10(3): 566-582. · Zbl 0201.36502
[9] Newman, M. F., O’Brien, E. A., Vaughan-Lee, M. R. (2004). Groups and nilpotent Lie rings whose order is the sixth power of a prime. J. Algebra. 278: 383-401. doi: · Zbl 1072.20022
[10] O’Brien, E. A. (1990). The p-group generation algorithm. J. Symb. Comput. 9: 677-698. · Zbl 0736.20001
[11] O’Brien, E. A., Vaughan-Lee, M. R. (2005). The groups with order p^7 for odd prime p. J. Algebra. 292: 243-358. · Zbl 1108.20016
[12] Vaughan-Lee, M. (2015). Groups of order p^8 and exponent p. Int. J. Group Theory. 4: 25-42. · Zbl 1456.20016
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.