| | | Dr Henna Koivusalo
~ Complexity of polytopal cut and project sets ~
Henna Koivusalo (University of Bristol) presented research on counting the number of distinct finite patterns in sets connected with the cut and project method of generating aperiodic tilings. The number typically tends towards infinity but under certain conditions the rate at which the count increases is polynomial. The talk looked at how this result was obtained using the acceptance domains technique in the cut and project window. Her talk was based upon a research paper from 2019 written with Jamie Walton.
| | |
