SearcharxivSearch

arXiv subjects

Alan Haynes

Publications and source records attributed to Alan Haynes.

At least 19 recordsLinked to original sources

The Gauss circle problem for Penrose tilings

Let $B_R$ denote the closed Euclidean ball of radius $R$ in the plane. In this paper we prove that, if $V$ is the set of vertices of any unit length rhombic Penrose tiling then, for $R\ge 2$, \[\#(V\cap B_R)=\pi C_P R^2 + O(R^{2/3}(\log R)^{2/3}),\] where $C_P\approx 1.231$ is a constant.

math.NT

Counting $2\times 2$ matrices with fixed determinant and bounded coefficients

Recent work by M. Afifurrahman established the first asymptotic estimates with error terms for the number of $2\times 2$ matrices with fixed non-zero determinant $n\in\mathbb{N}$, and with coefficients bounded in absolute value by $X$. In this paper we present a new proof of this result, which also gives an improved error term as $X\rightarrow\infty$. Similar to Afifurrahman's result, our error term is uniform in both $n$ and $X$, and our estimates are significant for $X$ as small as $n^{1/2+\delta}$. To complement this, we also demonstrate that the exponent $1/2+\delta$ in this statement cannot be reduced, by establishing a result which gives a different asymptotic main term when $n$ is either a prime or the square of a prime, and when $X=n^{1/2}$.

math.NT

Totally real cubic numbers are well approximable

In this paper we prove that all irrational numbers from totally real cubic number fields are well approximable by rationals (i.e. the partial quotients in the continued fraction expansion of such a number are unbounded). This settles the long standing open question of whether or not well approximable algebraic numbers exist. Our proof uses a number theoretic classification of approximations to algebraic numbers, together with a result of Lindenstrauss and Weiss which is an application of Ratner's orbit closure theorem.

math.NT

Accumulation points of normalized approximations

Building on classical aspects of the theory of Diophantine approximation, we consider the collection of all accumulation points of normalized integer vector translates of points $q\alpha$ with $\alpha\in\mathbb{R}^d$ and $q\in\mathbb{Z}$. In the first part of the paper we derive measure theoretic and Hausdorff dimension results about the set of $\alpha$ whose accumulation points are all of $\mathbb{R}^d$. In the second part we focus primarily on the case when the coordinates of $\alpha$ together with $1$ form a basis for an algebraic number field $K$. Here we show that, under the correct normalization, the set of accumulation points displays an ordered geometric structure which reflects algebraic properties of the underlying number field. For example, when $d=2$, this collection of accumulation points can be described as a countable union of dilates (by norms of elements of an order in $K$) of a single ellipse, or of a pair of hyperbolas, depending on whether or not $K$ has a non-trivial embedding into $\mathbb{C}$.

math.NT

Convergence of Fourier--Bohr coefficients for regular Euclidean model sets

It is well known that the Fourier--Bohr coefficients of regular model sets exist and are uniformly converging, volume-averaged exponential sums. Several proofs for this statement are known, all of which use fairly abstract machinery. For instance, there is one proof that uses dynamical systems theory and another one based on Meyer's theory of harmonious sets. Nevertheless, since the coefficients can be defined in an elementary way, it would be nice to have an alternative proof by similarly elementary means, which is to say by standard estimates of exponential sums under an appropriate use of the Poisson summation formula. Here, we present such a proof for the class of regular Euclidean model sets, that is, model sets with Euclidean physical and internal spaces and topologically regular windows with almost no boundary.

math.DS

Expected value of the smallest denominator in a random interval of fixed radius

We compute the probability mass function of the random variable which returns the smallest denominator of a reduced fraction in a randomly chosen real interval of radius $\delta/2$. As an application, we prove that the expected value of the smallest denominator is asymptotic, as $\delta\rightarrow 0$, to $(16/\pi^2)\delta^{-1/2}.$

math.NT

A three gap theorem for the adeles

We prove a natural generalization of the classical three gap theorem, for rotations on adelic tori. Our proof is an adaptation to the adeles of the lattice based approach to gaps problems in Diophantine approximation originally introduced by Marklof and Str\"ombergsson.

math.NT

Higher dimensional gap theorems for the maximum metric

Recently, the first author together with Jens Marklof studied generalizations of the classical three distance theorem to higher dimensional toral rotations, giving upper bounds in all dimensions for the corresponding numbers of distances with respect to any flat Riemannian metric. In dimension two they proved a five distance theorem, which is best possible. In this paper we establish analogous bounds, in all dimensions, for the maximum metric. We also show that in dimensions two and three our bounds are best possible.

math.NT

A five distance theorem for Kronecker sequences

The three distance theorem (also known as the three gap theorem or Steinhaus problem) states that, for any given real number $\alpha$ and integer $N$, there are at most three values for the distances between consecutive elements of the Kronecker sequence $\alpha, 2\alpha,\ldots, N\alpha$ mod 1. In this paper we consider a natural generalisation of the three distance theorem to the higher dimensional Kronecker sequence $\vec\alpha, 2\vec\alpha,\ldots, N\vec\alpha$ modulo an integer lattice. We prove that in two dimensions there are at most five values that can arise as a distance between nearest neighbors, for all choices of $\vec\alpha$ and $N$. Furthermore, for almost every $\vec\alpha$, five distinct distances indeed appear for infinitely many $N$ and hence five is the best possible general upper bound. In higher dimensions we have similar explicit, but less precise, upper bounds. For instance in three dimensions our bound is 13, though we conjecture the truth to be 9. We furthermore study the number of possible distances from a point to its nearest neighbor in a restricted cone of directions. This may be viewed as a generalisation of the gap length in one dimension. For large cone angles we use geometric arguments to produce explicit bounds directly analogous to the three distance theorem. For small cone angles we use ergodic theory of homogeneous flows in the space of unimodular lattices to show that the number of distinct lengths is (a) unbounded for almost all $\vec\alpha$ and (b) bounded for $\vec\alpha$ that satisfy certain Diophantine conditions.

math.NT

Level spacing statistics for the multi-dimensional quantum harmonic oscillator: algebraic case

We study the statistical properties of the spacings between neighboring energy levels for the multi-dimensional quantum harmonic oscillator that occur in a window $[E,E+\Delta E)$ of fixed width $\Delta E$ as $E$ tends to infinity. This regime provides a notable exception to the Berry-Tabor Conjecture from Quantum Chaos and, for that reason, it was studied extensively by Berry and Tabor in their seminal paper from 1977. We focus entirely on the case that the (ratios of) frequencies $\omega_1,\omega_2,\ldots,\omega_d$ together with $1$ form a basis for an algebraic number field $\Phi$ of degree $d+1$, allowing us to use tools from algebraic number theory. This special case was studied by Dyson, Bleher, Bleher-Homma-Ji-Roeder-Shen, and others. Under a suitable rescaling, we prove that the distribution of spacings behaves asymptotically quasiperiodically in $\log E$. We also prove that the distribution of ratios of neighboring spacings behaves asymptotically quasiperiodically in $\log E$. The same holds for the distribution of finite words in the finite alphabet of rescaled spacings. Mathematically, our work is a higher dimensional version of the Steinhaus Conjecture (Three Gap Theorem) involving the fractional parts of a linear form in more than one variable, and it is of independent interest from this perspective.

math.NT

Badly approximable points for diagonal approximation in solenoids

In this paper we investigate the problem of how well points in finite dimensional p-adic solenoids can be approximated by rationals. The setting we work in was previously studied by Palmer, who proved analogues of Dirichlet's theorem and the Duffin-Schaeffer theorem. We prove a complementary result, showing that the set of badly approximable points has maximum Hausdorff dimension. Our proof is a simple application of the elegant machinery of Schmidt's game.

math.NT

Bounded remainder sets for rotations on higher dimensional adelic tori

In this paper we give a simple, explicit construction of polytopal bounded remainder sets of all possible volumes, for any irrational rotation on the $d$ dimensional adelic torus $\mathbb{A}^d/\mathbb{Q}^d$. Our construction involves ideas from dynamical systems and harmonic analysis on the adeles, as well as a geometric argument that reduces the existence argument to the case of an irrational rotation on the torus $\mathbb{R}^d/\mathbb{Q}^d$.

math.NT

Higher moments of distances between consecutive Ford spheres

In previous work the second author derived an asymptotic formula for the sum of the distances between centers of consecutive Ford spheres. In this paper we extend these results by proving asymptotic formulas for higher moments of the distances. Our proofs rely on lattice point counting estimates with error terms coming from the Gauss circle problem.

math.NT

Bounded remainder sets for rotations on the adelic torus

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.

math.DS

Higher dimensional Steinhaus and Slater problems via homogeneous dynamics

The three gap theorem, also known as the Steinhaus conjecture or three distance theorem, states that the gaps in the fractional parts of $\alpha,2\alpha,\ldots, N\alpha$ take at most three distinct values. Motivated by a question of Erd\H{o}s, Geelen and Simpson, we explore a higher-dimensional variant, which asks for the number of gaps between the fractional parts of a linear form. Using the ergodic properties of the diagonal action on the space of lattices, we prove that for almost all parameter values the number of distinct gaps in the higher dimensional problem is unbounded. Our results in particular improve earlier work by Boshernitzan, Dyson and Bleher et al. We furthermore discuss a close link with the Littlewood conjecture in multiplicative Diophantine approximation. Finally, we also demonstrate how our methods can be adapted to obtain similar results for gaps between return times of translations to shrinking regions on higher dimensional tori.

math.NT

Averaging almost periodic functions along exponential sequences

The goal of this expository article is a fairly self-contained account of some averaging processes of functions along sequences of the form $(\alpha^n x)^{}_{n\in\mathbb{N}}$, where $\alpha$ is a fixed real number with $| \alpha | > 1$ and $x\in\mathbb{R}$ is arbitrary. Such sequences appear in a multitude of situations including the spectral theory of inflation systems in aperiodic order. Due to the connection with uniform distribution theory, the results will mostly be metric in nature, which means that they hold for Lebesgue-almost every $x\in\mathbb{R}$.

math.NT

A measure theoretic result for approximation by Delone sets

With a view to establishing measure theoretic approximation properties of Delone sets, we study a setup which arises naturally in the problem of averaging almost periodic functions along exponential sequences. In this setting, we establish a full converse of the Borel-Cantelli lemma. This provides an analogue of more classical problems in the metric theory of Diophantine approximation, but with the distance to the nearest integer function replaced by distance to an arbitrary Delone set.

math.DS

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