English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this paper we look for densest ball packings of Euclidean space E 3  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]).

Optimal ball packings for crystallographic groups of the cubic crystal system and their Dirichlet-Voronoi cells