Henna Koivusalo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Henna Koivusalo has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- James J. Walton
Mathematical Sciences Building University of Nottingham, University Park Nottingham UK
8 shared publications - Alan Haynes
Department of Mathematics, University of Houston, Houston, Texas 77204
7 shared publications - Balázs Bárány
Budapest University of Technology and Economics
3 shared publications - Michał Rams
Institute of Mathematics, Polish Academy of Sciences, Warszawa, Poland
3 shared publications - Antoine Julien
Faculty of education and arts Nord Universitet Høgskoleveien 27 7600 Levanger Levanger Norway
2 shared publications - Antti Käenmäki
Research Unit of Mathematical Sciences, P.O. Box 8000, FI-90014 University of Oulu, Finland
2 shared publications
Latest Publications
- Open Access
- 12 February 2026
- Published by Springer Nature in Monatshefte für Mathematik
Correction: Sharp density discrepancy for cut and project sets an approach via lattice point counting
- 12 February 2026
- Published by Springer Nature in Monatshefte für Mathematik
Open AccessCorrection: Sharp density discrepancy for cut and project sets an approach via lattice point counting
- Open Access
When is a cut and project set substitutional?
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 translational periods even though it retains some regularity of the lattice. Cut and project sets are one of the archetypical examples of patterns featuring aperiodic order, the other construction methods being by substitution and matching rules. Many early examples of aperiodic tilings, including the famous Penrose and Ammann--Beenker tilings, have a description from all of these methods. In this article we answer the following question, in the case of a Euclidean total space: what property of the cut and project data characterises when the resulting cut and project sets may also be defined by a substitution rule?
Open AccessWhen is a cut and project set substitutional?
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 translational periods even though it retains some regularity of the lattice. Cut and project sets are one of the archetypical examples of patterns featuring aperiodic order, the other construction methods being by substitution and matching rules. Many early examples of aperiodic tilings, including the famous Penrose and Ammann--Beenker tilings, have a description from all of these methods. In this article we answer the following question, in the case of a Euclidean total space: what property of the cut and project data characterises when the resulting cut and project sets may also be defined by a substitution rule?
- Open Access
- 14 November 2025
- Published by Springer Nature in Monatshefte für Mathematik
- Vol. 208 (3) , 397-444
Sharp density discrepancy for cut and project sets an approach via lattice point counting
Cut and project sets are obtained by taking an irrational slice of a lattice and projecting it to a lower dimensional subspace. We seek to quantify fluctuations from the asymptotic mean for point counts. We obtain uniform upper bounds on the discrepancy depending on the diophantine properties of the lattice. In an appendix, Michael Björklund and Tobias Hartnick obtain lower bounds on the $$\textrm{L}^2$$ norm of the discrepancy also depending on the diophantine class; these lower bounds match our uniform upper bounds and both are therefore sharp. This also allows us to find sharp bounds for the number of lattice points in thin slabs. Using a sufficient criteria of Burago–Kleiner and Aliste-Prieto–Coronel–Gambaudo we find an explicit full-measure class of cut and project sets that are biLipschitz equivalent to lattices; our lower bounds indicate that this is the largest class of cut and project sets for which those criteria can apply.- 14 November 2025
- Published by Springer Nature in Monatshefte für Mathematik
- Vol. 208 (3) , 397-444
Open AccessSharp density discrepancy for cut and project sets an approach via lattice point counting
Cut and project sets are obtained by taking an irrational slice of a lattice and projecting it to a lower dimensional subspace. We seek to quantify fluctuations from the asymptotic mean for point counts. We obtain uniform upper bounds on the discrepancy depending on the diophantine properties of the lattice. In an appendix, Michael Björklund and Tobias Hartnick obtain lower bounds on the $$\textrm{L}^2$$ norm of the discrepancy also depending on the diophantine class; these lower bounds match our uniform upper bounds and both are therefore sharp. This also allows us to find sharp bounds for the number of lattice points in thin slabs. Using a sufficient criteria of Burago–Kleiner and Aliste-Prieto–Coronel–Gambaudo we find an explicit full-measure class of cut and project sets that are biLipschitz equivalent to lattices; our lower bounds indicate that this is the largest class of cut and project sets for which those criteria can apply. - Open Access
Dynamical covering sets in self-similar sets
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 orbit in a dynamical system. In the case when the target sets are balls with sizes depending on the centre, we determine the size of the dynamical covering set as a function of the shrinking rate. In particular, we find sharp conditions guaranteeing when full Dvoretzky-type covering, and full measure occur. We also compute the Hausdorff dimension in the remaining cases. The proofs apply in the cases of targets centred at typical points of the self-similar set, with respect to any Bernoulli measure on it. Unlike in existing work on dynamical coverings, and despite the dimension value featuring phase transitions, we demonstrate that the behaviour can be characterised by a single pressure function over the full range of parameters. The techniques are a combination of classical dimension theoretical estimates and intricate martingale arguments.
Open AccessDynamical covering sets in self-similar sets
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 orbit in a dynamical system. In the case when the target sets are balls with sizes depending on the centre, we determine the size of the dynamical covering set as a function of the shrinking rate. In particular, we find sharp conditions guaranteeing when full Dvoretzky-type covering, and full measure occur. We also compute the Hausdorff dimension in the remaining cases. The proofs apply in the cases of targets centred at typical points of the self-similar set, with respect to any Bernoulli measure on it. Unlike in existing work on dynamical coverings, and despite the dimension value featuring phase transitions, we demonstrate that the behaviour can be characterised by a single pressure function over the full range of parameters. The techniques are a combination of classical dimension theoretical estimates and intricate martingale arguments.
- Open Access
Hausdorff dimension of shrinking targets on Przytycki-Urbański fractals
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 concerns points returning infinitely many times to a sequence of shrinking balls. In the iterated function system context, the shrinking balls problem is only well tractable in the case of similarity maps, but the case of affine maps is more elusive due to many geometric-dynamical complications. In the current work, we push through these complications and compute the Hausdorff dimension of a set recurring to a shrinking target of geometric balls in some affine iterated function systems. For these results, we have pinpointed a representative class of affine iterated function systems, consisting of a pair of diagonal affine maps, that was introduced by Przytycki and Urbański. The analysis splits into many sub-cases according to the type of the centre point of the targets, and the relative sizes of the targets and the contractions of the maps, illustrating the array of challenges of going beyond affine maps with nice projections. The proofs require heavy machinery from, and expand, the theory of Bernoulli convolutions.
Open AccessHausdorff dimension of shrinking targets on Przytycki-Urbański fractals
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 concerns points returning infinitely many times to a sequence of shrinking balls. In the iterated function system context, the shrinking balls problem is only well tractable in the case of similarity maps, but the case of affine maps is more elusive due to many geometric-dynamical complications. In the current work, we push through these complications and compute the Hausdorff dimension of a set recurring to a shrinking target of geometric balls in some affine iterated function systems. For these results, we have pinpointed a representative class of affine iterated function systems, consisting of a pair of diagonal affine maps, that was introduced by Przytycki and Urbański. The analysis splits into many sub-cases according to the type of the centre point of the targets, and the relative sizes of the targets and the contractions of the maps, illustrating the array of challenges of going beyond affine maps with nice projections. The proofs require heavy machinery from, and expand, the theory of Bernoulli convolutions.
- Open Access
Quantitative recurrence and the shrinking target problem for overlapping iterated function systems
In this paper we study quantitative recurrence and the shrinking target problem for dynamical systems coming from overlapping iterated function systems. Such iterated function systems have the important property that a point often has several distinct choices of forward orbit. As is demonstrated in this paper, this non-uniqueness leads to different behaviour to that observed in the traditional setting where every point has a unique forward orbit. We prove several almost sure results on the Lebesgue measure of the set of points satisfying a given recurrence rate, and on the Lebesgue measure of the set of points returning to a shrinking target infinitely often. In certain cases, when the Lebesgue measure is zero, we also obtain Hausdorff dimension bounds. One interesting aspect of our approach is that it allows us to handle targets that are not simply balls, but may have a more exotic geometry.
Open AccessQuantitative recurrence and the shrinking target problem for overlapping iterated function systems
In this paper we study quantitative recurrence and the shrinking target problem for dynamical systems coming from overlapping iterated function systems. Such iterated function systems have the important property that a point often has several distinct choices of forward orbit. As is demonstrated in this paper, this non-uniqueness leads to different behaviour to that observed in the traditional setting where every point has a unique forward orbit. We prove several almost sure results on the Lebesgue measure of the set of points satisfying a given recurrence rate, and on the Lebesgue measure of the set of points returning to a shrinking target infinitely often. In certain cases, when the Lebesgue measure is zero, we also obtain Hausdorff dimension bounds. One interesting aspect of our approach is that it allows us to handle targets that are not simply balls, but may have a more exotic geometry.
- Open Access
Cut and project sets with polytopal window I: complexity
We calculate the growth rate of the complexity function for polytopal cut and project sets. This generalises work of Julien where the almost canonical condition is assumed. The analysis of polytopal cut and project sets has often relied on being able to replace acceptance domains of patterns by so-called cut regions. Our results correct mistakes in the literature where these two notions are incorrectly identified. One may only relate acceptance domains and cut regions when additional conditions on the cut and project set hold. We find a natural condition, called the quasicanonical condition, guaranteeing this property and demonstrate via counterexample that the almost canonical condition is not sufficient for this. We also discuss the relevance of this condition for the current techniques used to study the algebraic topology of polytopal cut and project sets.
Open AccessCut and project sets with polytopal window I: complexity
We calculate the growth rate of the complexity function for polytopal cut and project sets. This generalises work of Julien where the almost canonical condition is assumed. The analysis of polytopal cut and project sets has often relied on being able to replace acceptance domains of patterns by so-called cut regions. Our results correct mistakes in the literature where these two notions are incorrectly identified. One may only relate acceptance domains and cut regions when additional conditions on the cut and project set hold. We find a natural condition, called the quasicanonical condition, guaranteeing this property and demonstrate via counterexample that the almost canonical condition is not sufficient for this. We also discuss the relevance of this condition for the current techniques used to study the algebraic topology of polytopal cut and project sets.
- 4 May 2022
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 375 (7) , 5097-5149
Cut and project sets with polytopal window II: linear repetitivity
In this paper we give a complete characterisation of linear repetitivity for cut and project schemes with convex polytopal windows satisfying a weak homogeneity condition. This answers a question of Lagarias and Pleasants from the 90s for a natural class of cut and project schemes which is large enough to cover almost all such polytopal schemes which are of interest in the literature. We show that a cut and project scheme in this class has linear repetitivity exactly when it has the lowest possible patch complexity and satisfies a Diophantine condition. Finding the correct Diophantine condition is a major part of the work. To this end we develop a theory, initiated by Forrest, Hunton and Kellendonk, of decomposing polytopal cut and project schemes to factors. We also demonstrate our main theorem on a wide variety of examples, covering all classical examples of canonical cut and project schemes, such as Penrose and Ammann–Beenker tilings.
- 4 May 2022
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 375 (7) , 5097-5149
Cut and project sets with polytopal window II: linear repetitivity
In this paper we give a complete characterisation of linear repetitivity for cut and project schemes with convex polytopal windows satisfying a weak homogeneity condition. This answers a question of Lagarias and Pleasants from the 90s for a natural class of cut and project schemes which is large enough to cover almost all such polytopal schemes which are of interest in the literature. We show that a cut and project scheme in this class has linear repetitivity exactly when it has the lowest possible patch complexity and satisfies a Diophantine condition. Finding the correct Diophantine condition is a major part of the work. To this end we develop a theory, initiated by Forrest, Hunton and Kellendonk, of decomposing polytopal cut and project schemes to factors. We also demonstrate our main theorem on a wide variety of examples, covering all classical examples of canonical cut and project schemes, such as Penrose and Ammann–Beenker tilings.
- Open Access
- 1 October 2021
- Published by Oxford University Press (OUP) in International Mathematics Research Notices
- Vol. 2023 (1) , 455-481
Uniform Random Covering Problems
Motivated by the random covering problem and the study of Dirichlet uniform approximable numbers, we investigate the uniform random covering problem. Precisely, consider an i.i.d. sequence $\omega =(\omega _n)_{n\geq 1}$ uniformly distributed on the unit circle $\mathbb{T}$ and a sequence $(r_n)_{n\geq 1}$ of positive real numbers with limit $0$. We investigate the size of the random set $$\begin{align*} & {\operatorname{{{\mathcal{U}}}}} (\omega):=\{y\in \mathbb{T}: \ \forall N\gg 1, \ \exists n \leq N, \ \text{s.t.} \ | \omega_n -y | < r_N \}. \end{align*}$$Some sufficient conditions for ${\operatorname{{{\mathcal{U}}}}}(\omega )$ to be almost surely the whole space, of full Lebesgue measure, or countable, are given. In the case that ${\operatorname{{{\mathcal{U}}}}}(\omega )$ is a Lebesgue null measure set, we provide some estimations for the upper and lower bounds of Hausdorff dimension.- 1 October 2021
- Published by Oxford University Press (OUP) in International Mathematics Research Notices
- Vol. 2023 (1) , 455-481
Open AccessUniform Random Covering Problems
Motivated by the random covering problem and the study of Dirichlet uniform approximable numbers, we investigate the uniform random covering problem. Precisely, consider an i.i.d. sequence $\omega =(\omega _n)_{n\geq 1}$ uniformly distributed on the unit circle $\mathbb{T}$ and a sequence $(r_n)_{n\geq 1}$ of positive real numbers with limit $0$. We investigate the size of the random set $$\begin{align*} & {\operatorname{{{\mathcal{U}}}}} (\omega):=\{y\in \mathbb{T}: \ \forall N\gg 1, \ \exists n \leq N, \ \text{s.t.} \ | \omega_n -y | < r_N \}. \end{align*}$$Some sufficient conditions for ${\operatorname{{{\mathcal{U}}}}}(\omega )$ to be almost surely the whole space, of full Lebesgue measure, or countable, are given. In the case that ${\operatorname{{{\mathcal{U}}}}}(\omega )$ is a Lebesgue null measure set, we provide some estimations for the upper and lower bounds of Hausdorff dimension. - Open Access
- 20 February 2020
- Published by Cambridge University Press (CUP) in Ergodic Theory and Dynamical Systems
- Vol. 41 (5) , 1431-1463
Cut and project sets with polytopal window I: Complexity
We calculate the growth rate of the complexity function for polytopal cut and project sets. This generalizes work of Julien where the almost canonical condition is assumed. The analysis of polytopal cut and project sets has often relied on being able to replace acceptance domains of patterns by so-called cut regions. Our results correct mistakes in the literature where these two notions are incorrectly identified. One may only relate acceptance domains and cut regions when additional conditions on the cut and project set hold. We find a natural condition, called the quasicanonical condition, guaranteeing this property and demonstrate by counterexample that the almost canonical condition is not sufficient for this. We also discuss the relevance of this condition for the current techniques used to study the algebraic topology of polytopal cut and project sets.
- 20 February 2020
- Published by Cambridge University Press (CUP) in Ergodic Theory and Dynamical Systems
- Vol. 41 (5) , 1431-1463
Open AccessCut and project sets with polytopal window I: Complexity
We calculate the growth rate of the complexity function for polytopal cut and project sets. This generalizes work of Julien where the almost canonical condition is assumed. The analysis of polytopal cut and project sets has often relied on being able to replace acceptance domains of patterns by so-called cut regions. Our results correct mistakes in the literature where these two notions are incorrectly identified. One may only relate acceptance domains and cut regions when additional conditions on the cut and project set hold. We find a natural condition, called the quasicanonical condition, guaranteeing this property and demonstrate by counterexample that the almost canonical condition is not sufficient for this. We also discuss the relevance of this condition for the current techniques used to study the algebraic topology of polytopal cut and project sets.