Let s>0, α,γ∈R, and let ψ:N→R>0 be a non-increasing function. Consider the limsup set W_s(ψ,α,γ) = \left\{ β\in[0,1] \colon \norm{nβ-γ} < \frac{ψ(n)}{\norm{nα}^{\,s}} \ \text{ for infinitely many } n\in\mathbb{N} \right\}. Chow [Duke J. Math. 2018] settled the measure-theoretic result for s=1. In this paper, we investigate the Lebesgue measure of Ws(ψ,α,γ) for general s>0.
Introduction
Metrical Diophantine approximation
A central theme in Diophantine approximation is to understand how well real numbers can be approximated by rationals. At the heart of metric number theory lies the study of the size—quantified via Lebesgue measure, Hausdorff dimension, Fourier dimension, etc.—of Diophantine sets defined by prescribed approximation conditions.
Given a function ψ:N→[0,∞) and a number α∈[0,1] (typically irrational), Diophantine approximation studies the existence of infinitely many pairs (m,n)∈Z×N satisfying
α−nm<nψ(n).(1)
For the critical case ψ(n)=1/n, Dirichlet’s Theorem guarantees that (1) holds for all α∈[0,1]. While this bound is asymptotically sharp for badly approximable numbers, Khintchine’s Theorem reveals that we can improve upon it for Lebesgue almost every α∈[0,1].
Define the set of well-approximable numbers as
W(ψ,δ):={α∈[0,1]:∥nα−δ∥<ψ(n) for i.m. n∈N}.
Here and in what follows “i.m.” stands for “infinitely many”, and ∥α∥ denotes the distance from α to the nearest integer.
Key words and phrases. Diophantine approximation; Duffin–Schaeffer conjecture.
*Corresponding author.
This work is supported by National Key R&D Program of China (No. 2024YFA1013700) and NSFC (Nos. 12671113, 12331005 and 12601156), and the Fundamental Research Funds for the Central Universities.
Theorem 1.1 (Khintchine, [21]). Let ψ be a monotonically decreasing function. Then the Lebesgue measure L(W(ψ,0)) is given by
L(W(ψ,0))={0,1,if ∑n∈Nψ(n)<∞,if ∑n∈Nψ(n)=∞.
Duffin and Schaeffer [11] later demonstrated that the monotonicity condition is essential: they constructed a ψ supported on highly composite integers such that
n=1∑∞ψ(n)=∞,L(W(ψ,0))=0.
They conjectured that for almost all α, the inequality ∣nα−m∣<ψ(n) has infinitely many coprime solutions (n,m) if and only if
n=1∑∞nϕ(n)ψ(n)=∞,(2)
where ϕ is Euler’s totient function. Following contributions by Gallagher [15], Erdős [13], Vaaler [34], and Pollington–Vaughan [27], the conjecture was resolved affirmatively by Koukoulopoulos and Maynard [22].
The inhomogeneous analogue of Khintchine’s theorem was established by Szűsz [32].
Theorem 1.2 (Szűsz, [32]). Let ψ:N→R+ be monotonically decreasing, and let δ∈R be fixed. Then
L(W(ψ,δ))={0,1,if ∑n∈Nψ(n)<∞,if ∑n∈Nψ(n)=∞.
The non-monotonic case is more intricate: counterexamples to relaxing monotonicity were given in [6, 29]. Recently, The coprime-numerator assertion fails in general. Hauke-Treuer, Maynard and Pollington [19] constructed counterexamples for all nonzero rational shifts and certain Liouville shifts; independently, He and Liao [20] obtained counterexamples for all nonzero rational shifts and a residual set of real shifts.
An open problem in this direction is the so-called weak inhomogeneous Duffin–Schaeffer conjecture (Conjecture 1.22, [9]). It asserts that if the divergence condition (2) holds, then for almost all α∈[0,1], the inequality ∥nα−δ∥<ψ(n) should have infinitely many solutions n∈N. Partial progress has been made in various aspects. For instance, it was solved for a wide class of non-monotonic functions in [5, 7, 9]. Results with extra divergence were established by Yu [35, 36]. More recently, OpenAI has announced a proof of the weak inhomogeneous Duffin–Schaeffer conjecture [24].
Theorem 1.3 (OpenAI, [24]). Let δ∈R, and let ψ:N→[0,∞). Then
L(W(ψ,δ))=1ifn=1∑∞nϕ(n)ψ(n)=∞.
Remark 1.4. While the divergence case is now fully resolved, a complete zero-one law for W(ψ,δ) remains unknown.
Multiplicative Diophantine approximation
Multiplicative Diophantine approximation is closely tied to Littlewood’s conjecture, which asserts that
n→∞liminfn∥nα∥∥nβ∥=0
for all α,β∈[0,1]. Einsiedler, Katok, and Lindenstrauss [12] proved that the exceptional set has Hausdorff dimension zero. However, the conjecture remains open, even for natural cases like (α,β)=(2,3). To date, the only non-trivial resolved instances are those where α and β lie in the same cubic field [4, 26].
Turning to the metric theory, we define the set of multiplicative well-approximable numbers as
W×(ψ):={(α,β)∈[0,1]×[0,1]:∥nα∥∥nβ∥<ψ(n) for i.m. n∈N}.
Theorem 1.5 (Gallagher, [16]). Let ψ:N→R+ be monotonically decreasing. Then
Without assuming monotonicity, Beresnevich, Haynes and Velani [2] proved a dichotomy for the Lebesgue measure of W×(ψ) under additional assumptions. By removing these conditions, Frühwirth and Hauke [14] established the following: for almost all (α,β)∈[0,1]2, there exist infinitely many n such that ∣nα−m1∣∣nβ−m2∣<ψ(n) with m1,m2 coprime to n, if and only if the series ∑nnϕ(n)ψ(n)log(ϕ(n)ψ(n)n) diverges.
Inhomogeneous multiplicative Diophantine approximation yields a natural yet nontrivial generalization of this theory. Fix δ,γ∈R, Shapira [31] proved that for almost every pair (α,β),
n→∞liminfn∥nα−δ∥∥nβ−γ∥=0.
This was subsequently improved by Gorodnik and Vishe [17], who showed that there exists ε>0 such that almost all (α,β)∈[0,1]2 satisfy
n→∞liminf(log5n)εn∥nα−γ∥⋅∥nβ−δ∥=0,
where log5 denotes the fifth iterate of the function x↦max{1,logx}. While the above results support Littlewood’s conjecture, Adiceam, Nesharim, and Lunnon [1] provided a counter-indication by proving that its function field analogue is false.
Fibre results are especially relevant to Littlewood-type problems because almost-everywhere results in the whole plane can avoid the most arithmetic pairs. Recall that the set of badly approximable numbers is defined as
Bad:={α∈[0,1]:n→∞liminfn∥nα∥>0}.
Borel–Cantelli lemma yields that Bad has Lebesgue measure zero, while by the Jarník–Besicovitch theorem, it has full Hausdorff dimension. Pollington and Velani [28] proved that for every α∈Bad, there exists a set G⊆Bad with dimHG=1 such that
n→∞liminfnlogn∥nα∥∥nβ∥≤1for every β∈G.
Chow and Zafeiropoulos [8] extended this result to the fully inhomogeneous setting and relaxed the assumption on α. Related developments include the Erdős–Vaaler-type fibre counting results of Yu [37] and the almost-everywhere multiplicative results on planar lines obtained by Chow and Yang [10].
Here we recall that an irrational real number α is Liouville if
n→∞liminfnw∥nα∥=0
for all w>0. The exponent of approximation of α∈[0,1] is defined as
w(α):=sup{w>0:∥nα∥<n−w for i.m. n∈N}.
Note that, for an irrational α, by definition, w(α)<∞ if and only if α is not Liouville. Beresnevich, Haynes and Velani [2] proved that if α is irrational and non-Liouville, and assuming the Duffin–Schaeffer conjecture, then
n→∞liminfn(logn)2∥nα−δ∥⋅∥nβ∥=0
for almost all β∈[0,1]. Later, Chow [5] proved this result unconditionally (without assuming the Duffin–Schaeffer conjecture) and in a stronger, function-based form. By finding large generalised arithmetic progressions within inhomogeneous Bohr sets, he showed that if α is irrational and non-Liouville, and ψ is nonincreasing, then
n=1∑∞ψ(n)logn=∞⟹∥nα−δ∥∥nβ∥<ψ(n) for i.m. n,
for almost every β. Furthermore, by combining this with Corollary 2.1 in [2], Chow established a complete zero-one law: if α∈Bad and ψ:N→R≥0 is a nonincreasing function, then the Lebesgue measure of the set
{β∈[0,1]:∥nβ∥<∥nα∥ψ(n) for i.m. n∈N}
is 0 or 1 according to the convergence or divergence of the series ∑nψ(n)logn. The fully inhomogeneous extension was established in the recent work of Chow and Technau [9]. In particular, building upon Corollary 2.1 in [2], they proved that if α∈Bad, and ψ is nonincreasing, then the Lebesgue measure of the set
{β∈[0,1]:∥nβ−γ∥<∥nα∥ψ(n) for i.m. n∈N}
is 0 or 1 according to the convergence or divergence of the series ∑n∈Nψ(n)logn.
In this paper, we further extend the inhomogeneous approximation problem by incorporating a weight into the approximation condition. More precisely, for an irrational number α, a shift γ∈R, a weight parameter s>0, and a nonincreasing function ψ:N→R>0, we study the Lebesgue measure of the set
Ws(ψ,α,γ):={β∈[0,1]:∥nβ−γ∥<∥nα∥sψ(n) for i.m. n∈N}.
Our main results read:
Theorem 1.6. Let 0<s<1, α∈[0,1]∖Q and γ∈R. Let ψ:N→R+ be a nonincreasing function. Then
L(Ws(ψ,α,γ))={0,1,if ∑n∈Nψ(n)logn<∞ and w(α)<1/s,if ∑n∈Nψ(n)logn=∞.
Theorem 1.7. Let s>1, α∈[0,1]∖Q and γ∈R. Let ψ:N→R+ be a nonincreasing function.
(1) If for some ε0>0,
n=1∑∞ψ(n)nw(α)s+ε0−1<∞,
then L(Ws(ψ,α,γ))=0.
(2) If
n=1∑∞ψ(n)loglognns−1=∞,
then L(Ws(ψ,α,γ))=1.
Let us make the following remarks regarding Theorems 1.6 and 1.7:
Khintchine’s Theorem and Dirichlet’s Theorem yields that L({α∈[0,1]:w(α)=1})=1. If s<1, the condition w(α)=1<1/s is automatically satisfied for almost every α.
Theorem 1.7 does not yield a complete zero-one law. The parameter ε0 originates from the limit superior in the definition of w(α). If qk+1≪qkw(α) holds eventually, this parameter can be eliminated. Namely, if ∑ψ(n)nw(α)s−1<∞, then L(W(ψ,α,γ))=0. The factor 1/loglogn in the divergence condition arises naturally
from Landau’s classical estimate for Euler’s totient function [23]: ϕ(n)/n≫1/loglogn. This bound is optimal, as the limit inferior of ϕ(n)/(nloglogn) is the positive constant e−γ (where γ≈0.5772 is the Euler–Mascheroni constant).
Application. For a,b>0 and a fixed irrational α, we define the weighted multiplicatively well-approximable fiber as
Wa,b×(ψ,α,γ):={β∈[0,1]:∥nα∥a∥nβ−γ∥b<ψ(n) for i.m. n∈N}.
By a direct substitution, this set is equivalent to the weighted inhomogeneous set:
Wa,b×(ψ,α,γ)=Wa/b(ψ1/b,α,γ).
Organization. The paper is organized as follows. In § 2, we collect some known auxiliary results that will be used in our proofs. In Section 3, we estimate the reciprocal sums ∑1≤n≤N∥nα∥−s for 0<s<1 and s>1, which serve as a key ingredient in our measure estimates. Sections 4 and 5 are devoted to the proofs of Theorems 1.6 and 1.7, respectively.
Notation. We use Vinogradov’s notation: A≪B means that A≤CB for some constant C>0. We write A≫B if B≪A, and A≍B if A≪B≪A.
Preliminaries
In this section, we present some auxiliary results required for the proofs of our main theorems.
Let α∈[0,1]∖Q, and write
α=[a1,a2,…]
for its continued-fraction expansion. Further, we write the finite truncations
[a1,a2,…,aj]:=qjpj
to be the n-th convergent to α. The following relations can be found in [30]:
qj+1=aj+1qj+qj−1,pj+1=aj+1pj+pj−1,
and
2qj+11<∣qjα−pj∣<qj+11.
We will often make use of the quantities
Dk=qkα−pk(k≥0).
Then
D0={α},Dk=(−1)k∥qkα∥(k≥1),
and
21≤qk+1∣Dk∣≤1(k≥0).
The following lemma provides a useful criterion for computing the Diophantine exponent ω(α) via the partial quotients of its continued fraction expansion.
Lemma 2.1 ([18]). Let α∈[0,1]\Q, and let {qk}k be the sequence of its continued fraction denominators. Then
ω(α)=k→∞limsuplogqklogqk+1.
The following lemma presents the Ostrowski expansion (or Ostrowski numeration) of the integers.
Lemma 2.2 ([25]). Let α=[a1,a2,…]∈[0,1]\Q. Then, for every n∈N, there is a unique integer K≥0 such that
qK≤n<qK+1,
and a unique sequence {ck+1}k=0∞ of integers such that
n=k=0∑∞ck+1qk,
where
0≤c1<a1and0≤ck+1≤ak+1(∀k≥1),
ck=0wheneverck+1=ak+1 with k≥1,
ck+1=0(∀k>K).
Using the unique Ostrowski expansion n=∑k=0∞ck+1qk provided by Lemma 2.2, let m≥0 be the minimal integer such that cm+1=0. The following lemma expresses ∥nα∥ in terms of the corresponding continued-fraction errors Dk.
Lemma 2.3 ([3], Lemma 4.1). Let α∈[0,1]\Q, n∈N, and, with reference to Lemma 2.2, let m be the smallest integer such that cm+1=0. If m≥2 then
∥nα∥=k=m∑∞ck+1Dk=sgn(Dm)⋅k=m∑∞ck+1Dk.(3)
Also if m=1 and {α}<1/2, then we have (3). In all other cases, ∥nα∥≥∣D2∣, which is a positive constant depending on α only.
Lemma 2.3 underpins the following two-sided estimate for ∥nα∥.
Lemma 2.4 ([3], Lemma 4.2). Let α∈[0,1)\Q and n∈N, and let m be the smallest integer such that cm+1=0. If ∥nα∥<∣D2∣ then m≥2, and if m≥2 then
Fix ℓ≥0. Let d1,…,dℓ+1 be non-negative integers satisfying
d1<a1,dk+1≤ak+1(1≤k≤ℓ),
and
dk=0whenever dk+1=ak+1,1≤k≤ℓ.
We define A(d1,…,dℓ+1) to be the set of all integers n∈N whose Ostrowski expansion begins with the fixed coefficients d1,…,dℓ+1. The corresponding truncated set is defined as
AN(d1,…,dℓ+1):=A(d1,…,dℓ+1)∩{1,…,N}.(4)
The following lemma provides a precise bound on the cardinality of these truncated sets.
Lemma 2.5 ([3], Lemma 5.3). Let N≥1 be an integer. Provided that AN(d1,…,dℓ+1) is non-empty, i.e., #AN(d1,…,dℓ+1)≥1, we have
3qℓ+1N≤#AN(d1,…,dℓ+1)≤qℓ+13N+1.
Estimates for reciprocal sums involving ∥nα∥−s
This section is devoted to estimating the reciprocal sum
1≤n≤N∑∥nα∥s1.
The core idea originates from Beresnevich, Haynes and Velani [3]. For a given N, let K be the integer uniquely determined by
qK≤N<qK+1.
Throughout this section, we assume N≥q3. This choice of K allows us to partition the integers 1≤n≤N into two disjoint sets according to their residues modulo qK: the regular classΩN,1 and the exceptional classΩN,2, defined as
ΩN,1:={n∈N:1≤n≤N,n≡0(modqK) and n≡qK−1(modqK)},
ΩN,2:={n∈N:1≤n≤N,n≡0(modqK) or n≡qK−1(modqK)}.
The exceptional class ΩN,2 requires special attention, since it corresponds to particularly small values of ∥nα∥.
Proposition 3.1. Let 0<s<1, α∈R∖Q and N≥q3. Let K be the largest integer satisfying qK≤N. Then
The proofs of the two propositions are structured according to the partition of the integers into regular and exceptional classes. Specifically, Subsection 3.1 is devoted to the estimates for the regular class ΩN,1, while the contribution from the exceptional class ΩN,2 will be treated in Subsection 3.2.
Estimates for the regular class
We begin by estimating the sum over the regular class ΩN,1. We split the sum into two parts: ∥nα∥<∣D2∣ and ∥nα∥≥∣D2∣:
Upper bounds for ∑n∈ΩN,1∥nα∥−s. For integers u and a satisfying 1≤u≤K+1 and 1≤a≤au+1, define
CN(u,a):=⎩⎨⎧1≤n≤N:the Ostrowski coefficients {ck+1}k=0∞ of n satisfyc1=⋯=cu−1=0, and either(i) cu=0 and cu+1=a+1, or(ii) cu=1 and cu+1=au+1−a⎭⎬⎫.
Clearly, each CN(u,a) is a subset of {1,…,N} by definition. Furthermore, the uniqueness of the Ostrowski expansion immediately implies that these sets are pairwise disjoint; that is, for any two distinct pairs (u1,a)=(u2,a′), we have CN(u1,a)∩CN(u2,a′)=∅. We now focus on the integers n for which ∥nα∥<∣D2∣. As the following lemma shows, these integers are fully covered by this disjoint union.
Lemma 3.3.
{1≤n≤N:∥nα∥<∣D2∣}⊆u=2⋃K+1a=1⋃au+1CN(u,a).
Proof. Take n in the set on the left, and let m be the smallest index such that cm+1=0 in its Ostrowski expansion. By Lemma 2.4, we have m≥2. Since n≤N<qK+1, we also have m≤K. Thus, 2≤m≤K.
We now distinguish two cases based on the value of cm+1:
Case 1:cm+1>1. We set u=m and a=cm+1−1. Then 1≤a≤am+1, and it follows directly from the definition that n∈CN(u,a).
Case 2:cm+1=1. We set u=m+1 and a=am+2−cm+2. Since 0≤cm+2<am+2, we have 1≤a≤am+2. Hence, n∈CN(m+1,a).
In either case, we obtain 2≤u≤K+1 and 1≤a≤au+1. This proves that n belongs to the disjoint union on the right. □
By Lemma 3.3, any integer n satisfying ∥nα∥<∣D2∣ must belong to some CN(u,a) with 2≤u≤K+1 and 1≤a≤au+1. In particular, if n∈ΩN,1, the range of u can be further restricted. The following lemma shows that the boundary cases u∈{K,K+1} always fall into the exceptional class ΩN,2. Consequently, for n∈ΩN,1 with ∥nα∥<∣D2∣, the associated parameters must satisfy 2≤u≤K−1 and 1≤a≤au+1.
Lemma 3.4. If n∈⋃u=KK+1⋃a=1au+1CN(u,a), then
n≡0(modqK)orn≡qK−1(modqK).
Proof. If n∈CN(K,a), then n≤N<qK+1, and its Ostrowski expansion can only be (a+1)qK or qK−1+(aK+1−a)qK. Thus, n≡0(modqK) or n≡qK−1(modqK), respectively.
If n∈CN(K+1,a), its Ostrowski expansion can only be n=qK+(aK+2−a)qK+1. Since n≤N<qK+1, this forces n=qK, giving n≡0(modqK). □
Lower bounds for ∑n∈ΩN,1∥nα∥−s. For m, a∈N, recall that
AN(m times0,…,0,a)={1≤n≤N:the Ostrowski expansion of n satisfiesck+1=0 for all k<m,cm+1=a}.
To simplify notation, we write A(0m,a) for AN(0,…,0,a). Since 1≤n≤N<qK+1, we have m≤K. Note that if m=K, then any n∈A(0m,a) must be of the form n=aqK, which yields n≡0(modqK). Thus, we restrict our attention to m≤K−1.
Furthermore, it is easily checked that if n∈A(0m,a) satisfies one of the following conditions:
Combining the upper bounds (5) with the lower bounds (6) and (7), we obtain
n∈ΩN,1∑∥nα∥s1≍{N,NqKs−1,if 0<s<1,if s>1,(8)
which completes the proof for the regular classes.
Estimates for the exceptional classes
We now treat the exceptional classes n≡0,qK−1(modqK). We begin with the class n≡0(modqK).
First, note that N≥q3 implies K≥3. Let 1≤n≤N satisfy n≡0(modqK). Then
n=aqKwith1≤a≤qKN.
Further, since N<qK+1=aK+1qK+qK−1, we have
a≤qKN<aK+1+qKqK−1<aK+1+1.
which implies a≤aK+1. Thus, n=aqK is the Ostrowski expansion of n. Since the only non-zero Ostrowski coefficient is cK+1=a, it follows from Lemma 2.3 that
Finally, together with (8) and (13), this completes the proofs of Propositions 3.1 and 3.2. In what follows, we obtain the following asymptotic formula for the full reciprocal sum:
If ∑ψ(n)<∞, the first Borel–Cantelli lemma yields L(Ws(ψ,α,γ))=0, completing the proof of the convergence part.
Divergence part (0<s<1). Since ψ(n)≤ψ(n)/∥nα∥s, we have the inclusion W(ψ,γ)⊂Ws(ψ,α,γ). By Theorem 1.2, the divergence condition ∑n=1∞ψ(n)=∞ ensures that W(ψ,γ) has full measure. It follows immediately that L(Ws(ψ,α,γ))=1.
Proof of Theorem 1.7
The proof proceeds in two steps:
the convergence part for s>1,
the divergence part for s>1.
Convergence part (s>1). For ε>0, combining Lemma 2.1 with qK≤N<qK+1, we deduce that for all sufficiently large K,
qK+1≤qKw(α)+ε/s≤Nw(α)+ε/s.
Substituting this bound into the estimate of (14), we obtain
1≤n≤N∑∥nα∥s1≪qK+1s≤Nw(α)s+ε.
Combining this bound with Abel’s summation formula, we deduce that
[1]F. Adiceam, E. Nesharim and F. Lunnon. On the \(t\)-adic Littlewood conjecture. Duke Math. J. 170 (2021), no. 10, 2371–2419.DOI
[2]V. Beresnevich, A. Haynes and S. Velani. Multiplicative zero-one laws and metric number theory. Acta Arith. 160 (2013), no. 2, 101–114.arxiv.org/abs/1012.0675
[3]V. Beresnevich, A. Haynes, and S. Velani. Sums of reciprocals of fractional parts and multiplicative Diophantine approximation. Mem. Amer. Math. Soc. 263 (2020), no. 1276.arxiv.org/abs/1511.06862
[4]J. Cassels and H. Swinnerton-Dyer. On the product of three homogeneous linear forms and indefinite ternary quadratic forms. Philos. Trans. Roy. Soc. London Ser. A 248 (1955), 73–96.DOI
[5]S. Chow. Box sets and multiplicative Diophantine approximation. Duke Math. J. 167 (2018), no. 9, 1623–1642.DOI
[6]S. Chow, M. Hauke, A. Pollington and F. A. Ramírez. General Duffin–Schaeffer-type counterexamples in Diophantine approximation. Mathematika, to appear, preprint 2025, arXiv:2504.16565.arxiv.org/abs/2504.16565
[7]S. Chow and N. Technau. Higher-rank Bohr sets and multiplicative Diophantine approximation. Compos. Math. 155 (2019), no. 11, 2214–2233.DOI
[8]S. Chow and A. Zafeiropoulos. Fully-inhomogeneous multiplicative Diophantine approximation of badly approximable numbers. Int. Math. Res. Not. IMRN (2022), no. 15, 11637–11670.arxiv.org/abs/2103.03605
[9]S. Chow and N. Technau. Littlewood and Duffin–Schaeffer-Type Problems in Diophantine Approximation. Mem. Amer. Math. Soc. 296 (2024), no. 1475.
[10]S. Chow and L. Yang. Effective equidistribution for multiplicative Diophantine approximation on lines. Invent. Math. 235 (2024), no. 3, 973–1007.arxiv.org/abs/1902.06081
[11]R. Duffin and A. Schaeffer. Khintchine’s problem in metric Diophantine approximation. Duke Math. J. 8 (1941), 243–255.DOI
[12]M. Einsiedler, A. Katok and E. Lindenstrauss. Invariant measures and the set of exceptions to Littlewood’s conjecture. Ann. of Math. (2) 164 (2006), 513–560.DOI
[13]P. Erdős, On the distribution of the convergents of almost all real numbers, J. Number Theory 2 (1970), 425–441.DOI
[14]L. Fruihwirth and M. Hauke. The Duffin-Schaeffer Conjecture for multiplicative Diophantine approximation. (2024), arXiv: 2403.11257.
[15]P. Gallagher, Approximation by reduced fractions. J. Math. Soc. Japan 13 (1961), 342–345.DOI
[16]P. Gallagher. Metric simultaneous Diophantine approximation. J. London Math. Soc. 37 (1962), 387–390.DOI
[17]A. Gorodnik and P. Vishe. Diophantine approximation for products of linear maps—logarithmic improvements. Trans. Amer. Math. Soc. 370 (2018), 487–507.
[18]G. Harman. Metric Number Theory. London Mathematical Society Monographs. New Series, vol. 18, Clarendon Press, Oxford University Press, New York, 1998.
[19]M. Hauke-Treuer, J. Maynard, and A. Pollington. Counterexamples to the inhomogeneous Duffin–Schaeffer conjecture. arXiv:2609.30921v1, 2026.arxiv.org/abs/2609.30921
[20]Y. He and L. Liao. Counterexamples to the inhomogeneous Duffin–Schaeffer conjecture for a residual set of shifts. arXiv:2609.30870v1, 2026.arxiv.org/abs/2609.30870
[21]A. Khintchine. Einige Sätze über Kettenbrüche, mit Anwendungen auf die Theorie der Diophantischen Approximationen. Math. Ann. 92 (1924), 115–125.
[22]D. Koukoulopoulos and J. Maynard. On the Duffin–Schaeffer conjecture. Ann. of Math. (2) 192 (2020), 251–307.arxiv.org/abs/1907.04593
[23]E. Landau. Handbuch der Lehre von der Verteilung der Primzahlen. Vol. 1, Teubner, Leipzig, 1909.
[24]OpenAI. The Weak Inhomogeneous Duffin–Schaeffer Conjecture. OpenAI Math Release preprint, OAI: The-weak-inhomogeneous-Duffin-Schaeffer-conjecture-September-25-2026, 2026.DOI
[25]A. Ostrowski. Bemerkungen zur Theorie der Diophantischen Approximationen. Abh. Math. Semin. Univ. Hambg., 1:77–98, 1922.
[26]L. G. Peck. Simultaneous rational approximations to algebraic numbers. Bull. Amer. Math. Soc. 67 (1961), 197–201.DOI
[27]A. D. Pollington and R. C. Vaughan, The k-dimensional Duffin and Schaeffer conjecture. Mathematika 37 (1990), 190–200.
[28]A. D. Pollington and S. L. Velani. On a problem in simultaneous Diophantine approximation: Littlewood’s conjecture. Acta Math. 185 (2000), 287–306.DOI
[29]F. A. Ramírez. Counterexamples, covering systems, and zero-one laws for inhomogeneous approximation. Int. J. Number Theory 13 (2017), 633–654.
[30]A. M. Rockett and P. Szűsz. Continued fractions. World Scientific Publishing Co., Inc., River Edge, NJ, 1992.
[31]U. Shapira. A solution to a problem of Cassels and Diophantine properties of cubic numbers. Ann. of Math. (2) 173 (2011), 543–557.arxiv.org/abs/0810.4289
[32]P. Süsz. Über die metrische Theorie der Diophantischen Approximation. Acta Math. Hungar. 9 (1958), 177–193.
[34]J. D. Vaaler, On the metric theory of Diophantine approximation, Pacific J. Math. 76 (1978), 527–539.DOI
[35]H. Yu. A Fourier-analytic approach to inhomogeneous Diophantine approximation. Acta Arith. 190 (2019), 263–292.arxiv.org/abs/1704.04691
[36]H. Yu. On the metric theory of inhomogeneous Diophantine approximation: an Erdős-Vaaler type result. J. Number Theory 224 (2021), 243–273.DOI
[37]H. Yu. On the metric theory of multiplicative Diophantine approximation. J. Anal. Math. 149 (2023), no. 2, 763–800.arxiv.org/abs/2010.09004