Constructing groups of ‘small’ order: Recent results and open problems

Abstract

We investigate the state of the art in the computational determination and enumeration of the groups of small order. This includes a survey of the available algorithms and a discussion of their recent improvements.We then show how these algorithms can be used to determine or enumerate the groups of order at most 20,000 with few exceptions and we discuss the orders in this range which remain as challenging open problems.