Search

Diophantine approximation is traditionally the study of how well real numbers are approximated by rationals. We propose a model for studying Diophantine approximation in an arbitrary totally bounded metric space where the rationals are replaced with a countable hierarchy of “well-spread” points, which we refer to as $abstract$ $rationals$. We prove various Jarník–Besicovitch type dimension bounds and investigate their sharpness, Oberwolfach Preprints;2021-07

In this paper we give an explicit construction of bounded remainder sets of all possible volumes, for any irrational rotation on the adelic torus $\mathbb A/\mathbb Q$. Our construction involves ideas from dynamical systems and harmonic analysis on the adeles, as well as a geometric argument which originated in the study of deformation properties of mathematical quasicrystals., 13 pages

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 \[ \mathcal U (\omega):=\{y\in \mathbb{T}: \ \forall N\gg 1, \ \exists n \leq N, \ \text{s.t.} \ \| \omega_n -y \| < r_N \}. \] Some sufficient conditions for $\mathcal U(\omega)$ to be almost surely the whole space, of full Lebesgue measure, or countable, are given. In the case that $\mathcal U(\omega)$ is a Lebesgue null measure set, we provide some estimations for the upper and lower bounds of Hausdorff dimension., Comment: 18 pages, 1 figure

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., 16 pages; v2: main result has improved

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., 32 pages, 5 figures

We construct for the first time examples of non-frustrated, two-body, infinite-range, one-dimensional classical lattice-gas models without periodic ground-state configurations. Ground-state configurations of our models are Sturmian sequences defined by irrational rotations on the circle. We present minimal sets of forbidden patterns which define Sturmian sequences in a unique way. Our interactions assign positive energies to forbidden patterns and are equal to zero otherwise. We illustrate our construction by the well-known example of the Fibonacci sequences., Comment: published online 2019 in Journal of Statistical Physics

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., 23 pages. Important change from previous version: we primarily focus on cubical cut and projects sets, and indicate toward the end how the results apply to canonical cut and project sets

For the development of a mathematical theory which can be used to rigorously investigate physical properties of quasicrystals, it is necessary to understand regularity of patterns in special classes of aperiodic point sets in Euclidean space. In one dimension, prototypical mathematical models for quasicrystals are provided by Sturmian sequences and by point sets generated by substitution rules. Regularity properties of such sets are well understood, thanks mostly to well known results by Morse and Hedlund, and physicists have used this understanding to study one dimensional random Schrödinger operators and lattice gas models. A key fact which plays an important role in these problems is the existence of a subadditive ergodic theorem, which is guaranteed when the corresponding point set is linearly repetitive.In this paper we extend the one-dimensional model to cut and project sets, which generalize Sturmian sequences in higher dimensions, and which are frequently used in mathematical and physical literature as models for higher dimensional quasicrystals. 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.

The mass transference principle, proved by Beresnevich and Velani in 2006, is a strong result that gives lower bounds for the Hausdorff dimension of limsup sets of balls. We present a version for limsup sets of open sets of arbitrary shape., Comment: 13 pages

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., Comment: 27 pages

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., 6 pages, newer version: added reference [1]

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., Comment: 27 pages, 4 figures

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., 22 pages

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., 17 pages, 5 figures

We calculate the almost sure Hausdorff dimension of the random covering set $\limsup_{n\to\infty}(g_n + \xi_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 $\xi_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., Comment: 16 pages, 1 figure

For any irrational cut-and-project setup, we demonstrate a natural infinite family of windows which gives rise to separated nets that are each bounded distance to a lattice. Our proof provides a new construction, using a sufficient condition of Rauzy, of an infinite family of non-trivial bounded remainder sets for any totally irrational toral rotation in any dimension., Comment: 11 pages, 1 figure, updated references, changed intro to give credit to a result of Liardet which we were previously unaware of

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., 13 pages

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., 22 pages