Research output: Working paper › Preprint

Date | Submitted - 2015 |
---|---|

Number of pages | 26 |

Original language | English |

By using a combination of algebraic, geometric, and dynamical techniques, together with input from higher dimensional Diophantine approximation, we give a complete characterization of all linearly repetitive cut and project sets with cubical windows. We also prove that these are precisely the collection of such sets which satisfy subadditive ergodic theorems. The results are explicit enough to allow us to apply them to known classical models, and to construct linearly repetitive cut and project sets in all pairs of dimensions and codimensions in which they exist.

## Gaps theorems and statistics of patterns in quasicrystals

Project: Research project (funded) › Research

## Diophantine approximation, chromatic number, and equivalence classes of separated nets

Project: Research project (funded) › Research

## Career Acceleration Fellowship: Circle rotations and their generalisation in Diophantine approximation

Project: Research project (funded) › Research

Find related publications, people, projects, datasets and more using interactive charts.