The number of groups of cubefree order
Abstract
Generalising Hölder's classical group enumeration for squarefree orders (1895), we provide an exact formula for the number of isomorphism types of groups of a given cubefree order. After more than 130 years, this is the first such formula that covers significantly more orders than the squarefree ones (83% versus 61% of all integers). Like Hölder's formula, ours is combinatorial: it can be evaluated from the prime factorisation of the order by arithmetic operations and table look-ups, without constructing a single group. The structure of our formula leads to counting formulas for natural subclasses of cubefree groups, with applications in computational group theory. We also derive new asymptotic results. Blackburn et al. (2007) conjectured that the number gnu(n) of groups of cubefree order n satisfies gnu(n)<n^2. We show that gnu(n)\leq n^{2+o(1)}, which improves the bound gnu(n)<n^8 recorded in their survey, and we prove that the exponent 2 is best possible, that is, gnu(n)\geq n^{2-o(1)} for infinitely many cubefree n. Lastly, we show that a much stronger form of the conjecture holds for almost every cubefree order, namely, \gnu(n)\leq (\log n)^{(\log\log n)^{O(1)}}.
Related
- On the number of conjugacy classes of finite solvable groups of order divisible by p2
- Non-vanishing mod p of derived Hecke algebras of multiplicative groups over number fields, II
- Ab-faithfulness of absolute Galois groups in number theory
- Some applications of the quasi-Riemann hypothesis to class groups and small generators of number fields
- The first ℓ2-Betti number, cost and rank gradient of few-relator random groups
BibTeX
@misc{dietrich2026number,
title = {{The number of groups of cubefree order}},
author = {Heiko Dietrich and David Jefferies},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2608.18815},
eprint = {2608.18815},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2608.18815},
}
RIS
TY - UNPB
TI - The number of groups of cubefree order
AU - Heiko Dietrich
AU - David Jefferies
PY - 2026
DA - 2026/09/02
PB - arXiv
DO - 10.48550/arxiv.2608.18815
UR - https://arxiv.org/abs/2608.18815
AB - Generalising Hölder's classical group enumeration for squarefree orders (1895), we provide an exact formula for the number of isomorphism types of groups of a given cubefree order. After more than 130 years, this is the first such formula that covers significantly more orders than the squarefree ones (83% versus 61% of all integers). Like Hölder's formula, ours is combinatorial: it can be evaluated from the prime factorisation of the order by arithmetic operations and table look-ups, without constructing a single group. The structure of our formula leads to counting formulas for natural subclasses of cubefree groups, with applications in computational group theory. We also derive new asymptotic results. Blackburn et al. (2007) conjectured that the number gnu(n) of groups of cubefree order n satisfies gnu(n)<n^2. We show that gnu(n)\leq n^{2+o(1)}, which improves the bound gnu(n)<n^8 recorded in their survey, and we prove that the exponent 2 is best possible, that is, gnu(n)\geq n^{2-o(1)} for infinitely many cubefree n. Lastly, we show that a much stronger form of the conjecture holds for almost every cubefree order, namely, \gnu(n)\leq (\log n)^{(\log\log n)^{O(1)}}.
ER -