The Open UniversitySkip to content

Combinatorial aspects of root lattices and words

Heuer, Manuela (2010). Combinatorial aspects of root lattices and words. PhD thesis The Open University.

Full text available as:
PDF (Version of Record) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (1MB)
Google Scholar: Look up in Google Scholar


This thesis is concerned with two topics that are of interest for the theory of aperiodic order. In the first part, the similar sublattices and coincidence site lattices of the root lattice A4 are analysed by means of a particular quaternion algebra. Dirichlet series generating functions are derived, which count the number of similar sublattices, respectively coincidence site lattices, of each index.

In the second part, several strategies to derive upper and lower bounds for the entropy of certain sets of powerfree words are presented. In particular, Kolpakov's arguments for the derivation of lower bounds for the entropy of powerfree words are generalised. For several explicit sets we derive very good upper and lower bounds for their entropy. Notably, Kolpakov's lower bounds for the entropy of ternary squarefree, binary cubefree and ternary minimally repetitive words are confirmed exactly.

Item Type: Thesis (PhD)
Copyright Holders: 2010 Manuela Heuer
Project Funding Details:
Funded Project NameProject IDFunding Body
Combinatorics of Sequences and Tilings and its ApplicationsEP/D058465/1EPSRC (Engineering and Physical Sciences Research Council)
Keywords: similar sublattices; coincidence site lattices; root lattice A4; Dirichlet series; entropy; powerfree words
Academic Unit/School: Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Item ID: 24046
Depositing User: Manuela Heuer
Date Deposited: 09 Dec 2010 20:11
Last Modified: 07 Dec 2018 10:25
Share this page:

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