Finite Group - Number of Groups of A Given Order

Number of Groups of A Given Order

Given a positive integer n, it is not at all a routine matter to determine how many isomorphism types of groups of order n there are. Every group of prime order is cyclic, since Lagrange's theorem implies that the cyclic subgroup generated by any of its non-identity elements is the whole group. If n is the square of a prime, then there are exactly two possible isomorphism types of group of order n, both of which are abelian. If n is a higher power of a prime, then results of Graham Higman and Charles Sims give asymptotically correct estimates for the number of isomorphism types of groups of order n, and the number grows very rapidly as the power increases.

Depending on the prime factorization of n, some restrictions may be placed on the structure of groups of order n, as a consequence, for example, of results such as the Sylow theorems. For example, every group of order pq is cyclic when q < p are primes with p-1 not divisible by q. For a necessary and sufficient condition, see cyclic number.

If n is squarefree, then any group of order n is solvable. A theorem of William Burnside, proved using group characters, states that every group of order n is solvable when n is divisible by fewer than three distinct primes. By the Feit–Thompson theorem, which has a long and complicated proof, every group of order n is solvable when n is odd.

For every positive integer n, most groups of order n are solvable. To see this for any particular order is usually not difficult (for example, there is, up to isomorphism, one non-solvable group and 12 solvable groups of order 60) but the proof of this for all orders uses the classification of finite simple groups. For any positive integer n there are at most two simple groups of order n, and there are infinitely many positive integers n for which there are two non-isomorphic simple groups of order n.

Read more about this topic:  Finite Group

Famous quotes containing the words number of, number, groups and/or order:

    Hence, a generative grammar must be a system of rules that can iterate to generate an indefinitely large number of structures. This system of rules can be analyzed into the three major components of a generative grammar: the syntactic, phonological, and semantic components.
    Noam Chomsky (b. 1928)

    That country is the richest which nourishes the greatest number of noble and happy human beings.
    John Ruskin (1819–1900)

    Writers and politicians are natural rivals. Both groups try to make the world in their own images; they fight for the same territory.
    Salman Rushdie (b. 1947)

    The world men inhabit ... is rather bleak. It is a world full of doubt and confusion, where vulnerability must be hidden, not shared; where competition, not co-operation, is the order of the day; where men sacrifice the possibility of knowing their own children and sharing in their upbringing, for the sake of a job they may have chosen by chance, which may not suit them and which in many cases dominates their lives to the exclusion of much else.
    Anna Ford (b. 1943)