Use this URL to cite or link to this record in EThOS:
Title: Combinatorial aspects of root lattices and words
Author: Heuer, Manuela
ISNI:       0000 0004 2695 8727
Awarding Body: Open University
Current Institution: Open University
Date of Award: 2010
Availability of Full Text:
Access from EThOS:
Access from Institution:
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.
Supervisor: Not available Sponsor: Engineering and Physical Sciences Research Council
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral