Searcharxiv⌕ Search

arXiv subjects

Alan Haynes

Publications and source records attributed to Alan Haynes.

At least 37 records · Page 2Linked to original sources

Sums of reciprocals of fractional parts and multiplicative Diophantine approximation

There are two main interrelated goals of this paper. Firstly we investigate the sums \[ S_N(α,γ):=\sum_{n=1}^N\frac{1}{n\|nα-γ\|}~~~\text{and}~~~ R_N(α,γ):=\sum_{n=1}^N\frac{1}{\|nα-γ\|}\,, \] where $α$ and $γ$ are real parameters and $\|\cdot\|$ is the distance to the nearest integer. Our theorems improve upon previous results of W. M. Schmidt and others, and are (up to constants) best possible. Related to the above sums, we also obtain upper and lower bounds for the cardinality of \[ \{1\le n\le N:\|nα-γ\|<\varepsilon\} \, , \] valid for all sufficiently large $N$ and all sufficiently small $\varepsilon$. This first strand of the work is motivated by applications to multiplicative Diophantine approximation, which are also considered. In particular, we obtain complete Khintchine type results for multiplicative simultaneous Diophantine approximation on fibers in $\mathbb{R}^2$. The divergence result is the first of its kind and represents an attempt of developing the concept of ubiquity to the multiplicative setting.

math.NT↗

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↗

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↗

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↗

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↗

Hankel Determinants of Zeta Values

We study the asymptotics of Hankel determinants constructed using the values $ζ(an+b)$ of the Riemann zeta function at positive integers in an arithmetic progression. Our principal result is a Diophantine application of the asymptotics.

math.NT↗

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↗

Equivalence relations on separated nets arising from linear toral flows

In 1998, Burago-Kleiner and McMullen independently proved the existence of separated nets in $\mathbb{R}^d$ which are not bi-Lipschitz equivalent (BL) to a lattice. A finer equivalence relation than BL is bounded displacement (BD). Separated nets arise naturally as return times to a section for minimal $\mathbb{R}^d$-actions. We analyze the separated nets which arise via these constructions, focusing particularly on nets arising from linear $\mathbb{R}^d$-actions on tori. We show that generically these nets are BL to a lattice, and for some choices of dimensions and sections, they are generically BD to a lattice. We also show the existence of such nets which are not BD to a lattice.

math.DS↗

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↗

Diophantine approximation and coloring

We demonstrate how connections between graph theory and Diophantine approximation can be used in conjunction to give simple and accessible proofs of seemingly difficult results in both subjects.

math.NT↗

Equivalence classes of codimension one cut-and-project nets

We prove that in any totally irrational cut-and-project setup with codimension (internal space dimension) one, it is possible to choose sections (windows) in non-trivial ways so that the resulting sets are bounded displacement to lattices. Our proof demonstrates that for any irrational $α$, regardless of Diophantine type, there is a collection of intervals in $\mathbb{R}/\mathbb{Z}$ which is closed under translation, contains intervals of arbitrarily small length, and along which the discrepancy of the sequence $\{nα\}$ is bounded above uniformly by a constant.

math.DS↗

Multiplicative zero-one laws and metric number theory

We develop the classical theory of Diophantine approximation without assuming monotonicity or convexity. A complete `multiplicative' zero-one law is established akin to the `simultaneous' zero-one laws of Cassels and Gallagher. As a consequence we are able to establish the analogue of the Duffin-Schaeffer theorem within the multiplicative setup. The key ingredient is the rather simple but nevertheless versatile `cross fibering principle'. In a nutshell it enables us to `lift' zero-one laws to higher dimensions.

math.NT↗

Density of orbits of semigroups of endomorphisms acting on the Adeles

We investigate the question of whether or not the orbit of a point in A/Q, under the natural action of a subset S of Q, is dense in A/Q. We prove that if the set S is a multiplicative semigroup which contains at least two multiplicatively independent elements, one of which is an integer, then the orbit under S of any point with irrational real coordinate is dense.

math.NT↗

Metrical musings on Littlewood and friends

We prove a metrical result on a family of conjectures related to the Littlewood conjecture, namely the original Littlewood conjecture, the mixed Littlewood conjecture of de Mathan and Teulié and a hybrid between a conjecture of Cassels and the Littlewood conjecture. It is shown that the set of numbers satisfying a strong version of all of these conjectures is large in the sense of Hausdorff dimension restricted to the set of badly approximable numbers.

math.NT↗

Inhomogeneous approximation by coprime integers

This paper addresses a problem recently raised by Laurent and Nogueira about inhomogeneous Diophantine approximation with coprime integers. As a corollary of our main theorem we obtain an improvement of the best known exponent of approximation in this problem, from 1/2 to 1-epsilon, for any epsilon>0.

math.NT↗