6 papers
Badly approximable points on non-linear carpets
Roope Anttila, Jonathan M. Fraser, Henna Koivusalo
The badly approximable points in are those for which Dirichlet's approximation theorem cannot be improved by more than a constant, that is, they are the points most…
When is a cut and project set substitutional?
Edmund Harriss, Henna Koivusalo, James J. Walton
Cut and project sets are obtained by projecting an irrational slice through a lattice to a lower dimensional subspace. Under standard conditions, the resulting pattern has no trans…
On the Fourier transform of random Bernoulli convolutions
Simon Baker, Henna Koivusalo, Sascha Troscheit +1
We investigate random Bernoulli convolutions, namely, probability measures given by the infinite convolution \[ μ_Ï= \mathop{\circledast}_{k=1}^{\infty} \left( \frac{δ_0 + δ_{Î…
Dynamical covering sets in self-similar sets
Balazs Barany, Henna Koivusalo, Sascha Troscheit
We study the size of \emph{dynamical covering sets} on a self-similar set. Dynamical covering sets are limsup sets generated by placing shrinking target sets around points along an…
Hausdorff dimension of shrinking targets on Przytycki-UrbaÅski fractals
Thomas Jordan, Henna Koivusalo
Shrinking target problems in the context of iterated function systems have received an increasing amount of interest in the past few years. The classical shrinking target problem c…
Sharp density discrepancy for cut and project sets: An approach via lattice point counting
Henna Koivusalo, Jean Lagacé, Michael Björklund +1
Cut and project sets are obtained by taking an irrational slice of a lattice and projecting it to a lower dimensional subspace, and are fully characterised by the shape of the slic…