Searcharxiv⌕ Search

arXiv subjects

Henna Koivusalo

Publications and source records attributed to Henna Koivusalo.

32 records · Page 2Linked to original sources
arXiv2017

Linear repetitivity and subadditive ergodic theorems for cut and project sets

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.

math.DS↗
arXiv2017

Statistics of patterns in typical cut and project sets

In this article pattern statistics of typical cubical cut and project sets are studied. We give estimates for the rate of convergence of appearances of patches to their asymptotic frequencies. We also give bounds for repetitivity and repulsivity functions. The proofs use ideas and tools developed in discrepancy theory.

math.DS↗
arXiv2016

A randomized version of the Littlewood Conjecture

The Littlewood Conjecture in Diophantine approximation can be thought of as a problem about covering the plane by a union of hyperbolas centered at rational points. In this paper we consider the problem of translating the center of each hyperbola by a random amount which depends on the denominator of the corresponding rational. Using a randomized covering argument we prove that, not only is this randomized version of the Littlewood Conjecture true for almost all choices of centers, an even stronger statement with an extra factor of a logarithm also holds.

math.NT↗
arXiv2016

Hitting probabilities of random covering sets in tori and metric spaces

We provide sharp lower and upper bounds for the Hausdorff dimension of the intersection of a typical random covering set with a fixed analytic set both in Ahlfors regular metric spaces and in the $d$-dimensional torus. In metric spaces, we consider covering sets generated by balls and, in the torus, we deal with general analytic generating sets.

math.PR↗
arXiv2016

Constructing bounded remainder sets and cut-and-project sets which are bounded distance to lattices, II

Recent results of several authors have led to constructions of parallelotopes which are bounded remainder sets for totally irrational toral rotations. In this brief note we explain, in retrospect, how some of these results can easily be obtained from a geometric argument which was previously employed by Duneau and Oguey in the study of deformation properties of mathematical models for quasicrystals.

math.DS↗
arXiv2015

Self-affine sets with fibered tangents

We study tangent sets of strictly self-affine sets in the plane. If a set in this class satisfies the strong separation condition and projects to a line segment for sufficiently many directions, then for each generic point there exists a rotation $\mathcal O$ such that all tangent sets at that point are either of the form $\mathcal O((\mathbb R \times C) \cap B(0,1))$, where $C$ is a closed porous set, or of the form $\mathcal O((\ell \times \{ 0 \}) \cap B(0,1))$, where $\ell$ is an interval.

math.CA↗
arXiv2015

Recurrence to shrinking targets on typical self-affine fractals

We explore the problem of finding the Hausdorff dimension of the set of points that recur to shrinking targets on a self-affine fractal. To be exact, we study the dimension of a certain related symbolic recurrence set. In many cases this set is equivalent to the recurring set on the fractal.

math.DS↗
arXiv2015

Perfectly ordered quasicrystals and the Littlewood conjecture

Linearly repetitive cut and project sets are mathematical models for perfectly ordered quasicrystals. In a previous paper we presented a characterization of linearly repetitive cut and project sets. In this paper we extend the classical definition of linear repetitivity to try to discover whether or not there is a natural class of cut and project sets which are models for quasicrystals which are better than `perfectly ordered'. In the positive direction, we demonstrate an uncountable collection of such sets (in fact, a collection with large Hausdorff dimension) for every choice of dimension of the physical space. On the other hand we show that, for many natural versions of the problems under consideration, the existence of these sets turns out to be equivalent to the negation of a well known open problem in Diophantine approximation, the Littlewood conjecture.

math.DS↗
arXiv2014

Gaps problems and frequencies of patches in cut and project sets

We establish a connection between gaps problems in Diophantine approximation and the frequency spectrum of patches in cut and project sets with special windows. Our theorems provide bounds for the number of distinct frequencies of patches of size r, which depend on the precise cut and project sets being used, and which are almost always less than a power of log r. Furthermore, for a substantial collection of cut and project sets we show that the number of frequencies of patches of size r remains bounded as r tends to infinity. The latter result applies to a collection of cut and project sets of full Hausdorff dimension.

math.DS↗
arXiv2013

Dimension of uniformly random self-similar fractals

We calculate the almost sure Hausdorff dimension of uniformly random self-similar fractals. These random fractals are generated from a finite family of similarities, where the linear parts of the mappings are independent uniformly distributed random variables at each step of iteration. We also prove that the Lebesgue measure of such sets is almost surely positive in some cases.

math.DS↗
arXiv2013

Projections of random covering sets

We show that, almost surely, the Hausdorff dimension $s_0$ of a random covering set is preserved under all orthogonal projections to linear subspaces with dimension $k>s_0$. The result holds for random covering sets with a generating sequence of ball-like sets, and is obtained by investigating orthogonal projections of a class of random Cantor sets.

math.CA↗
arXiv2013

Hausdorff dimension of affine random covering sets in torus

We calculate the almost sure Hausdorff dimension of the random covering set $\limsup_{n\to\infty}(g_n + ξ_n)$ in $d$-dimensional torus $\mathbb T^d$, where the sets $g_n\subset\mathbb T^d$ are parallelepipeds, or more generally, linear images of a set with nonempty interior, and $ξ_n\in\mathbb T^d$ are independent and uniformly distributed random points. The dimension formula, derived from the singular values of the linear mappings, holds provided that the sequences of the singular values are decreasing.

math.PR↗
arXiv2012

Dimensions of random affine code tree fractals

We calculate the almost sure Hausdorff dimension for a general class of random affine planar code tree fractals. The set of probability measures describing the randomness includes natural measures in random $V$-variable and homogeneous Markov constructions.

math.DS↗