We study the Diophantine transference principle over function fields. By adapting the approach of Beresnevich and Velani [‘An inhomogeneous transference principle and Diophantine approximation’, Proc. Lond. Math. Soc. (3) 101 (2010), 821–851] to function fields, we extend many results from homogeneous to inhomogeneous Diophantine approximation. This also yields the inhomogeneous Baker–Sprindžuk conjecture over function fields and upper bounds for the general nonextremal scenario.

Let $\psi : \mathbb {N} \to [0,1/2]$ be given. The Duffin–Schaeffer conjecture, recently resolved by Koukoulopoulos and Maynard, asserts that for almost all reals $\alpha$ there are infinitely many coprime solutions $(p,q)$ to the inequality $|\alpha - p/q| < \psi (q)/q$, provided that the series $\sum _{q=1}^\infty \varphi (q) \psi (q) / q$ is divergent. In the present paper, we establish a quantitative version of this result, by showing that for almost all $\alpha$ the number of coprime solutions $(p,q)$, subject to $q \leq Q$, is of asymptotic order $\sum _{q=1}^Q 2 \varphi (q) \psi (q) / q$. The proof relies on the method of GCD graphs as invented by Koukoulopoulos and Maynard, together with a refined overlap estimate from sieve theory, and number-theoretic input on the ‘anatomy of integers’. The key phenomenon is that the system of approximation sets exhibits ‘asymptotic independence on average’ as the total mass of the set system increases.

We consider the two-dimensional shrinking target problem in beta dynamical systems (for general $\beta>1$ ) with general errors of approximation. Let $f, g$ be two positive continuous functions. For any $x_0,y_0\in [0,1]$ , define the shrinking target set

$$ \begin{align*}E(T_\beta, f,g):=\left\{(x,y)\in [0,1]^2: \begin{array}{@{}ll@{}} \lvert T_{\beta}^{n}x-x_{0}\rvert <e^{-S_nf(x)}\\[1ex] \lvert T_{\beta}^{n}y-y_{0}\rvert < e^{-S_ng(y)} \end{array} \ {\text{for infinitely many}} \ n\in \mathbb N \right\}, \end{align*} $$

where $S_nf(x)=\sum _{j=0}^{n-1}f(T_\beta ^jx)$ is the Birkhoff sum. We calculate the Hausdorff dimension of this set and prove that it is the solution to some pressure function. This represents the first result of this kind for the higher-dimensional beta dynamical systems.

Given an infinite subset $\mathcal{A} \subseteq\mathbb{N}$ , let A denote its smallest N elements. There is a rich and growing literature on the question of whether for typical $\alpha\in[0,1]$ , the pair correlations of the set $\alpha A (\textrm{mod}\ 1)\subset [0,1]$ are asymptotically Poissonian as N increases. We define an inhomogeneous generalisation of the concept of pair correlation, and we consider the corresponding doubly metric question. Many of the results from the usual setting carry over to this new setting. Moreover, the double metricity allows us to establish some new results whose singly metric analogues are missing from the literature.

We show that fractal percolation sets in $\mathbb{R}^{d}$ almost surely intersect every hyperplane absolutely winning (HAW) set with full Hausdorff dimension. In particular, if $E\subset\mathbb{R}^{d}$ is a realisation of a fractal percolation process, then almost surely (conditioned on $E\neq\emptyset$), for every countable collection $\left(f_{i}\right)_{i\in\mathbb{N}}$ of $C^{1}$ diffeomorphisms of $\mathbb{R}^{d}$, $\dim_{H}\left(E\cap\left(\bigcap_{i\in\mathbb{N}}f_{i}\left(\text{BA}_{d}\right)\right)\right)=\dim_{H}\left(E\right)$, where $\text{BA}_{d}$ is the set of badly approximable vectors in $\mathbb{R}^{d}$. We show this by proving that E almost surely contains hyperplane diffuse subsets which are Ahlfors-regular with dimensions arbitrarily close to $\dim_{H}\left(E\right)$.

We achieve this by analysing Galton–Watson trees and showing that they almost surely contain appropriate subtrees whose projections to $\mathbb{R}^{d}$ yield the aforementioned subsets of E. This method allows us to obtain a more general result by projecting the Galton–Watson trees against any similarity IFS whose attractor is not contained in a single affine hyperplane. Thus our general result relates to a broader class of random fractals than fractal percolation.

An effective estimate for the measure of the set of real numbers for which the inequality |P(x)|<Q-w for $w > {3 \over 2}n + 1$ has a solution in integral polynomials P of degree n and of height H(P) at most $Q \in {\rm{\mathbb N}}$ is obtained.

For fixed $\alpha \in [0,1]$ , consider the set $S_{\alpha ,N}$ of dilated squares $\alpha , 4\alpha , 9\alpha , \dots , N^2\alpha \, $ modulo $1$ . Rudnick and Sarnak conjectured that, for Lebesgue, almost all such $\alpha $ the gap-distribution of $S_{\alpha ,N}$ is consistent with the Poisson model (in the limit as N tends to infinity). In this paper, we prove a new estimate for the triple correlations associated with this problem, establishing an asymptotic expression for the third moment of the number of elements of $S_{\alpha ,N}$ in a random interval of length $L/N$ , provided that $L> N^{1/4+\varepsilon }$ . The threshold of $\tfrac {1}{4}$ is substantially smaller than the threshold of $\tfrac {1}{2}$ (which is the threshold that would be given by a naïve discrepancy estimate).

Unlike the theory of pair correlations, rather little is known about triple correlations of the dilations $(\alpha a_n \, \text {mod } 1)_{n=1}^{\infty } $ for a nonlacunary sequence $(a_n)_{n=1}^{\infty } $ of increasing integers. This is partially due to the fact that the second moment of the triple correlation function is difficult to control, and thus standard techniques involving variance bounds are not applicable. We circumvent this impasse by using an argument inspired by works of Rudnick, Sarnak, and Zaharescu, and Heath-Brown, which connects the triple correlation function to some modular counting problems.

In Appendix B, we comment on the relationship between discrepancy and correlation functions, answering a question of Steinerberger.

We establish the limiting distribution of certain subsets of Farey sequences, i.e., sequences of primitive rational points, on expanding horospheres in covers $\unicode[STIX]{x1D6E5}\backslash \text{SL}(n+1,\mathbb{R})$ of $\text{SL}(n+1,\mathbb{Z})\backslash \text{SL}(n+1,\mathbb{R})$, where $\unicode[STIX]{x1D6E5}$ is a finite-index subgroup of $\text{SL}(n+1,\mathbb{Z})$. These subsets can be obtained by projecting to the hyperplane $\{(x_{1},\ldots ,x_{n+1})\in \mathbb{R}^{n+1}:x_{n+1}=1\}$ sets of the form $\mathbf{A}=\bigcup _{j=1}^{J}\mathbf{a}_{j}\unicode[STIX]{x1D6E5}$, where for all $j$, $\mathbf{a}_{j}$ is a primitive lattice point in $\mathbb{Z}^{n+1}$. Our method involves applying the equidistribution of expanding horospheres in quotients of $\text{SL}(n+1,\mathbb{R})$ developed by Marklof and Strömbergsson, and more precisely understanding how the full Farey sequence distributes in $\unicode[STIX]{x1D6E5}\backslash \text{SL}(n+1,\mathbb{R})$ when embedded on expanding horospheres as done in previous work by Marklof. For each of the Farey sequence subsets, we extend the statistical results by Marklof regarding the full multidimensional Farey sequences, and solutions by Athreya and Ghosh to Diophantine approximation problems of Erdős–Szüsz–Turán and Kesten. We also prove that Marklof’s result on the asymptotic distribution of Frobenius numbers holds for sets of primitive lattice points of the form $\mathbf{A}$.

Let $\unicode[STIX]{x1D6F9}:[1,\infty )\rightarrow \mathbb{R}_{+}$ be a non-decreasing function, $a_{n}(x)$ the $n$th partial quotient of $x$ and $q_{n}(x)$ the denominator of the $n$th convergent. The set of $\unicode[STIX]{x1D6F9}$-Dirichlet non-improvable numbers,

$$\begin{eqnarray}G(\unicode[STIX]{x1D6F9}):=\{x\in [0,1):a_{n}(x)a_{n+1}(x)>\unicode[STIX]{x1D6F9}(q_{n}(x))\text{ for infinitely many }n\in \mathbb{N}\},\end{eqnarray}$$

$1/q^{2}\unicode[STIX]{x1D6F9}(q)$

${\mathcal{K}}(\unicode[STIX]{x1D6F9})$

${\mathcal{K}}(3\unicode[STIX]{x1D6F9})\subset G(\unicode[STIX]{x1D6F9})$

$s$

$s\in (0,1)$

$G(\unicode[STIX]{x1D6F9})\setminus {\mathcal{K}}(3\unicode[STIX]{x1D6F9})$

${\mathcal{K}}(\unicode[STIX]{x1D6F9})$

$G(\unicode[STIX]{x1D6F9})$

In this paper, we provide two new extensions to a lemma of Bernik (1983). Applications are also discussed.

We generalize Skriganov’s notion of weak admissibility for lattices to include standard lattices occurring in Diophantine approximation and algebraic number theory, and we prove estimates for the number of lattice points in sets such as aligned boxes. Our result improves on Skriganov’s celebrated counting result if the box is sufficiently distorted, the lattice is not admissible, and, e.g., symplectic or orthogonal. We establish a criterion under which our error term is sharp, and we provide examples in dimensions $2$ and $3$ using continued fractions. We also establish a similar counting result for primitive lattice points, and apply the latter to the classical problem of Diophantine approximation with primitive points as studied by Chalk, Erdős, and others. Finally, we use o-minimality to describe large classes of sets to which our counting results apply.

We study metric Diophantine approximation for function fields, specifically, the problem of improving Dirichlet's theorem in Diophantine approximation.

We study the problem of Diophantine approximation on lines in $\mathbb{R}^{d}$ under certain primality restrictions.

We prove a result in the area of twisted Diophantine approximation related to the theory of Schmidt games. In particular, under certain restrictions we give an affirmative answer to the analogue in this setting of a famous conjecture of Schmidt from Diophantine approximation.

Let $\unicode[STIX]{x1D6FD}>1$ be a real number and define the $\unicode[STIX]{x1D6FD}$ -transformation on $[0,1]$ by $T_{\unicode[STIX]{x1D6FD}}:x\mapsto \unicode[STIX]{x1D6FD}x\,\text{mod}\,1$ . Further, define

$$\begin{eqnarray}W_{y}(T_{\unicode[STIX]{x1D6FD}},\unicode[STIX]{x1D6F9}):=\{x\in [0,1]:|T_{\unicode[STIX]{x1D6FD}}^{n}x-y|<\unicode[STIX]{x1D6F9}(n)\text{ for infinitely many }n\}\end{eqnarray}$$

$$\begin{eqnarray}W(T_{\unicode[STIX]{x1D6FD}},\unicode[STIX]{x1D6F9}):=\{(x,y)\in [0,1]^{2}:|T_{\unicode[STIX]{x1D6FD}}^{n}x-y|<\unicode[STIX]{x1D6F9}(n)\text{ for infinitely many }n\},\end{eqnarray}$$

$\unicode[STIX]{x1D6F9}:\mathbb{N}\rightarrow \mathbb{R}_{{>}0}$

$\unicode[STIX]{x1D6F9}(n)\rightarrow 0$

$n\rightarrow \infty$

Maillet proved that the set of Liouville numbers is preserved under rational functions with rational coefficients. Based on this result, a problem posed by Mahler is to investigate whether there exist entire transcendental functions with this property or not. For large parametrized classes of Liouville numbers, we construct such functions and moreover we show that they can be constructed such that all their derivatives share this property. We use a completely different approach than in a recent paper, where functions with a different invariant subclass of Liouville numbers were constructed (though with no information on derivatives). More generally, we study the image of Liouville numbers under analytic functions, with particular attention to $f(z)=z^{q}$, where $q$ is a rational number.

The Hausdorff dimension of the set of simultaneously τ-well-approximable points lying on a curve defined by a polynomial P(X) + α, where P(X) ∈ ℤ[X] and α ∈ ℝ, is studied when τ is larger than the degree of P(X). This provides the first results related to the computation of the Hausdorff dimension of the set of well-approximable points lying on a curve that is not defined by a polynomial with integer coefficients. The proofs of the results also include the study of problems in Diophantine approximation in the case where the numerators and the denominators of the rational approximations are related by some congruential constraint.

In this paper, the Khintchine-type theorems of Beresnevich (Acta Arith. 90 (1999), 97) and Bernik (Acta Arith. 53 (1989), 17) for polynomials are generalised to incorporate a natural restriction on derivatives. This represents the first attempt to solve a problem posed by Bernik, Kleinbock and Margulis (Int. Math. Res. Notices2001(9) (2001), 453). More specifically, the main result provides a probabilistic criterion for the solvability of the system of inequalities |P(x)| < Ψ1(H) and |P′(x)| < Ψ2(H) in integral polynomials P of degree ≤ n and height H, where Ψ1 and Ψ2 are fairly general error functions. The proof builds upon Sprindzuk's method of essential and inessential domains and the recent ideas of Beresnevich, Bernik and Götze (Compositio Math. 146 (2010), 1165) concerning the distribution of algebraic numbers.

Borel conjectured that all algebraic irrational numbers are normal in base 2. However, very little is known about this problem. We improve the lower bounds for the number of digit changes in the binary expansions of algebraic irrational numbers.