Number of groups of given order: Difference between revisions

From Groupprops
Line 134: Line 134:
===Asymptotic facts and conjectures===
===Asymptotic facts and conjectures===


* [[Higman-Sims asymptotic formula on number of groups of prime power order]]
* [[Higman-Sims asymptotic formula on number of groups of prime power order]]: This states that the number of groups of order <math>p^n</math> is about <math>p^{(2n^3/27) + O(n^{8/3}}</math>.
* [[Pyber's theorem on logarithmic quotient of number of nilpotent groups to number of groups approaching unity]]
* [[Pyber's theorem on logarithmic quotient of number of nilpotent groups to number of groups approaching unity]]
* [[Higman's PORC conjecture]]
* [[Higman's PORC conjecture]] states that the number of groups of order <math>p^n</math> is a [[PORC function]] in <math>p</math> for fixed <math>n</math>.


==Properties==
==Properties==

Revision as of 17:10, 17 April 2010

Definition

Let n be a natural number. The number of groups of order n is defined as the number of isomorphism classes of groups whose order is n.

This is a finite number and is bounded by n2n for obvious reasons. The function is not strictly increasing in n and depends heavily on the nature of the prime factorization of n.

Initial values

The ID of the sequence of these numbers in the Online Encyclopedia of Integer Sequences is A000001

n Number of groups of order n Reason/explanation
1 1
2 1 prime number
3 1 prime number
4 2 square of a prime; see classification of groups of prime-square order
5 1 prime number
6 2 form pq where p,q primes, qp1
7 1 prime number
8 5 prime cube: classification of groups of prime-cube order, also see groups of order 8
9 2 prime square; see classification of groups of prime-square order

Orders 10 to 36. [SHOW MORE]

Orders greater than 36. We omit prime numbers, squares of primes, and numbers of the form

pq

where

p,q

both primes, since these are covered by standard cases.[SHOW MORE]

Facts

Basic facts

Value of n What we can say about the number of groups of order n Explanation
1 1 only the trivial group
p a prime number 1 only the group of prime order. See equivalence of definitions of group of prime order
p2, p prime 2 only the cyclic group of prime-square order and the elementary abelian group of prime-square order
p3, p prime 5 see classification of groups of prime-cube order
24=16 14 see classification of groups of order 16, also groups of order 16 for summary information.
p4, p odd prime 15 see classification of groups of prime-fourth order for odd prime
25=32 51
35=243 67
p5, prime p5 2p+61+2gcd(p1,3)+gcd(p1,4)
p6, prime p5 3p2+39p+344+24gcd(p1,3)+11gcd(p1,4)+2gcd(p1,5)
product p1p2pn, pi distinct primes with no pi dividing pj1 1 the cyclic group of that order. See classification of cyclicity-forcing numbers
product pq, p,q primes with p dividing q1 2
product 4p, p prime, p>3, p1(mod4) 4
product 4p, p prime, p1(mod4) 5

Asymptotic facts and conjectures

Properties

Supermultiplicativity

If n=ab with a and b relatively prime, the number of groups of order n is bounded from below by the product of the number of groups of orders a and b respectively. This is because we can take direct products for every pair of a group of order a and a group of order b.