For given $\epsilon>0$ and $b\in \mathbb {R}^m$, we say that a real $m\times n$ matrix A is $\epsilon $-badly approximable for the target b if

$$ \begin{align*}\liminf_{q\in\mathbb{Z}^n, \|q\|\to\infty} \|q\|^n \langle Aq-b\rangle^m \geq \epsilon,\end{align*} $$

$\langle \cdot \rangle $

$\epsilon $

$\epsilon $

$\epsilon $

Schmidt games and the Cantor winning property give alternative notions of largeness, similar to the more standard notions of measure and category. Being intuitive, flexible, and applicable to recent research made them an active object of study. We survey the definitions of the most common variants and connections between them. A new game called the Cantor game is invented and helps with presenting a unifying framework. We prove surprising new results such as the coincidence of absolute winning and $1$ Cantor winning in metric spaces, and the fact that $1/2$ winning implies absolute winning for subsets of $\mathbb {R}$. We also suggest a prototypical example of a Cantor winning set to show the ubiquity of such sets in metric number theory and ergodic theory.

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 set of elements in a translation of the middle-third Cantor set which can be well approximated by algebraic numbers of bounded degree. A doubling dimensional result is given, which enables one to conclude an upper bound on the dimension of the set in question for a generic translation.

We build on the recent techniques of Codogni and Patakfalvi (2021, Inventiones Mathematicae 223, 811–894), which were used to establish theorems about semi-positivity of the Chow Mumford line bundles for families of $\mathrm {K}$ -semistable Fano varieties. Here, we apply the Central Limit Theorem to ascertain the asymptotic probabilistic nature of the vertices of the Harder and Narasimhan polygons. As an application of our main result, we use it to establish a filtered vector space analogue of the main technical result of Codogni and Patakfalvi (2021, Inventiones Mathematicae 223, 811–894). In doing so, we expand upon the slope stability theory, for filtered vector spaces, that was initiated by Faltings and Wüstholz (1994, Inventiones Mathematicae 116, 109–138). One source of inspiration for our abstract study of Harder and Narasimhan data, which is a concept that we define here, is the lattice reduction methods of Grayson (1984, Commentarii Mathematici Helvetic 59, 600–634). Another is the work of Faltings and Wüstholz (1994, Inventiones Mathematicae 116, 109–138), and Evertse and Ferretti (2013, Annals of Mathematics 177, 513–590), which is within the context of Diophantine approximation for projective varieties.

Let q a prime power and ${\mathbb F}_q$ the finite field of q elements. We study the analogues of Mahler’s and Koksma’s classifications of complex numbers for power series in ${\mathbb F}_q((T^{-1}))$ . Among other results, we establish that both classifications coincide, thereby answering a question of Ooto.

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\hspace{0.6em}({\rm mod}\hspace{0.2em}1)$. Let $f:[0,1]\rightarrow [0,1]$ and $g:[0,1]\rightarrow [0,1]$ be two Lipschitz functions. The main result of the paper is the determination of the Hausdorff dimension of the set

$$\begin{eqnarray}W(f,g,\unicode[STIX]{x1D70F}_{1},\unicode[STIX]{x1D70F}_{2})=\big\{(x,y)\in [0,1]^{2}:|T_{\unicode[STIX]{x1D6FD}}^{n}x-f(x)|<\unicode[STIX]{x1D6FD}^{-n\unicode[STIX]{x1D70F}_{1}(x)},|T_{\unicode[STIX]{x1D6FD}}^{n}y-g(y)|<\unicode[STIX]{x1D6FD}^{-n\unicode[STIX]{x1D70F}_{2}(y)}~\text{for infinitely many}~n\in \mathbb{N}\big\},\end{eqnarray}$$

$\unicode[STIX]{x1D70F}_{1}$

$\unicode[STIX]{x1D70F}_{2}$

$\unicode[STIX]{x1D70F}_{1}(x)\leq \unicode[STIX]{x1D70F}_{2}(y)$

$x,y\in [0,1]$

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}$.

In 1984, K. Mahler asked how well elements in the Cantor middle third set can be approximated by rational numbers from that set and by rational numbers outside of that set. We consider more general missing digit sets $C$ and construct numbers in $C$ that are arbitrarily well approximable by rationals in $C$, but badly approximable by rationals outside of $C$. More precisely, we construct them so that all but finitely many of their convergents lie in $C$.

We establish several new metrical results on the distribution properties of the sequence ({xn})n≥1, where {·} denotes the fractional part. Many of them are presented in a more general framework, in which the sequence of functions (x ↦ xn)n≥1 is replaced by a sequence (fn)n≥1, under some growth and regularity conditions on the functions fn.

In this paper, we study the mixed Littlewood conjecture with pseudo-absolute values. For any pseudo-absolute-value sequence ${\mathcal{D}}$, we obtain a sharp criterion such that for almost every $\unicode[STIX]{x1D6FC}$ the inequality

$$\begin{eqnarray}|n|_{{\mathcal{D}}}|n\unicode[STIX]{x1D6FC}-p|\leq \unicode[STIX]{x1D713}(n)\end{eqnarray}$$

$(n,p)\in \mathbb{N}\times \mathbb{Z}$

$\unicode[STIX]{x1D713}$

${\mathcal{D}}_{1},{\mathcal{D}}_{2},\ldots ,{\mathcal{D}}_{k}$

$\unicode[STIX]{x1D713}(n)$

$\unicode[STIX]{x1D6FC}$

$$\begin{eqnarray}|n|_{{\mathcal{D}}_{1}}|n|_{{\mathcal{D}}_{2}}\cdots |n|_{{\mathcal{D}}_{k}}|n\unicode[STIX]{x1D6FC}-p|\leq \unicode[STIX]{x1D713}(n)\end{eqnarray}$$

$(n,p)\in \mathbb{N}\times \mathbb{Z}$

In this paper we establish a general form of the mass transference principle for systems of linear forms conjectured in 2009. We also present a number of applications of this result to problems in Diophantine approximation. These include a general transference of Lebesgue measure Khintchine–Groshev type theorems to Hausdorff measure statements. The statements we obtain are applicable in both the homogeneous and inhomogeneous settings as well as allowing transference under any additional constraints on approximating integer points. In particular, we establish Hausdorff measure counterparts of some Khintchine–Groshev type theorems with primitivity constraints recently proved by Dani, Laurent and Nogueira.

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

We give measure estimates for sets appearing in the study of dynamical systems, such as preimages of Diophantine classes.

We provide a closed formula of Bowen type for the Hausdorff dimension of a very general shrinking target scheme generated by the nonautonomous dynamical system on the interval $[0,1)$, viewed as $\mathbb{R}/\mathbb{Z}$, corresponding to a given method of Cantor series expansion. We also examine a wide class of examples utilising our theorem. In particular, we give a Diophantine approximation interpretation of our scheme.

Let $\Vert \cdot \Vert$ denote the distance to the nearest integer and, for a prime number $p$, let $|\cdot |_{p}$ denote the $p$-adic absolute value. Over a decade ago, de Mathan and Teulié [Problèmes diophantiens simultanés, Monatsh. Math. 143 (2004), 229–245] asked whether $\inf _{q\geqslant 1}$$q\cdot \Vert q{\it\alpha}\Vert \cdot |q|_{p}=0$ holds for every badly approximable real number ${\it\alpha}$ and every prime number $p$. Among other results, we establish that, if the complexity of the sequence of partial quotients of a real number ${\it\alpha}$ grows too rapidly or too slowly, then their conjecture is true for the pair $({\it\alpha},p)$ with $p$ an arbitrary prime.

We consider classes of subsets of [0, 1], originally introduced by Falconer, that are closed under countable intersections, and such that every set in the class has Hausdorff dimension at least s. We provide a Frostman-type lemma to determine if a limsup set is in such a class. Suppose that E = lim sup En ⊂ [0, 1], and that μn are probability measures with support in En. If there exists a constant C such that

for all n, then, under suitable conditions on the limit measure of the sequence (μn), we prove that the set E is in the class .

As an application we prove that, for α > 1 and almost all λ ∈ (½, 1), the set

where and ak ∈ {0, 1}}, belongs to the class . This improves one of our previously published results.