In this paper we look for densest ball packings of Euclidean space E3 to given symmetry groups. We restrict our investigation to the 36 space groups of the cubic crystal system, and we search for only those packings where the group acts simply transitively on the balls. In order to find the centre of a ball and its radius for the case of an optimal packing we will apply an algorithm and the corresponding computer program, which was developed by the second author [21, 12]. In the list of our results we will give the coordinates of the ball centre and the radius, moreover, we will compute the density of the optimal packing and display the corresponding D-V cell for each space group above (see also [14, 15]).
Print ISSN: 0044-2968
Volume: 221, 01/2006
Pages: 099 - 103