Counting isomorphism classes of groups of Fibonacci type with a prime power number of generators (Q6170784)

The groups of Fibonacci type are defined by the cyclic presentations: \[ G_{n}(m,k) = \langle x_{0}, \ldots , x_{n-1} \mid x_{i}x_{i+m} = x_{i+k}\; \; (0 \leq i < n) \rangle \] (subscripts \(\mod n\)). The problem of determining the number of isomorphism classes of irreducible groups \(G_{n}(m,k)\) as a function \(\sigma(n)\) was investigated in [\textit{A. Cavicchioli} et al., J. Algebra, 320, 11, 4063--4072 (2008; Zbl 1201.20027)]. In the case \(n=p^{\ell}\), where \(p\) is prime, \(\ell\geq 1\) and \(n \not \in \{2,4\}\), it was conjectured in [loc. cit.] that a particular function \(C(p^{\ell})\), that is polynomial in \(p\), is the exact value of \(\sigma(p^{\ell})\). In the paper under review, the authors prove that \(C(p^{\ell})\) is an upper bound for \(\sigma(p^{\ell})\).