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 (1135Kb)
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/Department: Mathematics, Computing and Technology > Mathematics and Statistics
Item ID: 24046
Depositing User: Manuela Heuer
Date Deposited: 09 Dec 2010 20:11
Last Modified: 26 Mar 2014 05:57
Share this page:

Actions (login may be required)

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340