Group number function: Difference between revisions
| Line 32: | Line 32: | ||
It is not known whether or not there is a number <math>n</math> such that <math>\mathrm{gnu}(n)=n</math>. | It is not known whether or not there is a number <math>n</math> such that <math>\mathrm{gnu}(n)=n</math>. | ||
===The galloping gnu conjecture=== | |||
John H. Conway, Heiko Dietrich and E.A. O’Brien ask the question<ref>[https://www.math.auckland.ac.nz/~obrien/research/gnu.pdf | John H. Conway, Heiko Dietrich and E.A. O’Brien, Counting groups: gnus, moas and other exotica]</ref>: does, for every <math>n</math>, the sequence <math>n, \mathrm{gnu}(n), \mathrm{gnu}(\mathrm{gnu}(n)), \dots</math> eventually contain a <math>1</math>? They have verified it for <math>n < 2047</math>. | |||
==References== | ==References== | ||
Revision as of 22:40, 8 November 2023
Definition
The group number function or gnu function is the function defined by equal to the number of groups of order up to isomorphism.
Examples of values
Let be a prime number. Then:
- , see classification of groups of prime order
- , see classification of groups of prime-square order
- , see classification of groups of prime-cube order
- , for , see Classification of groups of prime-fourth order
- , see classification of groups of order two times a prime
Asymptotic bounds
Prime power order
Further information: Enumeration of groups of prime power order
Higman[1] demonstrated a bound for the group number function for groups of order for prime (i.e. p-groups), namely for some as .[2]
Open problems
The following are currently open problems relating to the group number function.
Values of the group number function
Certain values of the group number function are unknown, and thus the groups of that order are not classified. The smallest such example is for . See groups of order 2048. We do happen to know that the value of strictly exceeds .[3]
Fixed points of the group number function
It is not known whether or not there is a number such that .
The galloping gnu conjecture
John H. Conway, Heiko Dietrich and E.A. O’Brien ask the question[4]: does, for every , the sequence eventually contain a ? They have verified it for .
References
- ↑ Enumerating p-groups by Graham Higman, Proceedings of the London Mathematical Society, ISSN 1460244X (online), ISSN 00246115 (print), (Year 1959): More info
- ↑ Michael Vaughan-Lee, On Graham Higman's famous PORC paper (2012), pp. 1
- ↑ | John H. Conway, Heiko Dietrich and E.A. O’Brien, Counting groups: gnus, moas and other exotica
- ↑ | John H. Conway, Heiko Dietrich and E.A. O’Brien, Counting groups: gnus, moas and other exotica