The Open UniversitySkip to content

Bravais colourings of planar modules with N-fold symmetry

Baake, Michael and Grimm, Uwe (2004). Bravais colourings of planar modules with N-fold symmetry. Zeitschrift für Kristallographie, 219(2) pp. 72–80.

Full text available as:
PDF (Not Set) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (146kB)
DOI (Digital Object Identifier) Link:
Google Scholar: Look up in Google Scholar


The first step in investigating colour symmetries for periodic and aperiodic systems is the determination of all colouring schemes that are compatible with the symmetry group of the underlying structure, or with a subgroup of it. For an important class of colourings of planar structures, this mainly combinatorial question can be addressed with methods of algebraic number theory. We present the corresponding results for all planar modules with N-fold symmetry that emerge as the rings of integers in cyclotomic fields with class number one. The counting functions are multiplicative and can be encapsulated in Dirichlet series generating functions, which turn out to be the Dedekind zeta functions of the corresponding cyclotomic fields.

Item Type: Journal Item
ISSN: 0044-2968
Extra Information: Preprint version math.CO/0301021 available at
Keywords: Colourings; Planar modules; Cyclotomic fields; Dirichlet series
Academic Unit/School: Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Faculty of Science, Technology, Engineering and Mathematics (STEM)
Item ID: 2196
Depositing User: Uwe Grimm
Date Deposited: 29 Sep 2006
Last Modified: 02 May 2019 11:28
Share this page:


Altmetrics from Altmetric

Citations from Dimensions

Download history for this item

These details should be considered as only a guide to the number of downloads performed manually. Algorithmic methods have been applied in an attempt to remove automated downloads from the displayed statistics but no guarantee can be made as to the accuracy of the figures.

Actions (login may be required)

Policies | Disclaimer

© The Open University   contact the OU