2020
DOI: 10.4064/aa180905-22-7
|View full text |Cite
|
Sign up to set email alerts
|

A perturbed Khinchin-type theorem and solutions to linear equations in Piatetski-Shapiro sequences

Abstract: Our main result concerns a perturbation of a classic theorem of Khintchine in Diophantine approximation. We give sufficient conditions on a sequence of positive real numbers (ψn) n∈N and differentiable functions (ϕn : J → R) n∈N so that for Lebesgue-a.e. θ ∈ J, the inequality nθ + ϕn(θ) ≤ ψn has infinitely many solutions. The main novelty is that the magnitude of the perturbation |ϕn(θ)| is allowed to exceed ψn, changing the usual "shrinking targets" problem into a "shifting targets" problem. As an application… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
3
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 3 publications
(17 reference statements)
0
3
0
Order By: Relevance
“…Matsusaka and Saito [10] showed that, for all t > s > 2 and a, b, c ∈ N, the set of all α ∈ [s, t] such that the equation ax + by = cz is solvable, has positive Hausdorff dimension. Glasscock [11] showed that if the equation y = ax + b with real numbers a = 0, 1 and b is solvable in N, then, for Lebesgue-a.e. α ∈ (1, 2) (resp.…”
Section: Introductionmentioning
confidence: 99%
“…Matsusaka and Saito [10] showed that, for all t > s > 2 and a, b, c ∈ N, the set of all α ∈ [s, t] such that the equation ax + by = cz is solvable, has positive Hausdorff dimension. Glasscock [11] showed that if the equation y = ax + b with real numbers a = 0, 1 and b is solvable in N, then, for Lebesgue-a.e. α ∈ (1, 2) (resp.…”
Section: Introductionmentioning
confidence: 99%
“…In this article, we discuss the solvability in PS(α) of the equation (1.1) y = ax + b for fixed a, b ∈ R with a / ∈ {0, 1}. Glasscock proved that if equation (1.1) is solvable in N, then for Lebesgue almost every α > 1, it is solvable or not in PS(α) according as α < 2 or α > 2 [Gla17,Gla20]. In addition, as a corollary, he showed that for Lebesgue almost every 1 < α < 2, there are infinitely many (k, ℓ, m) ∈ N 3 such that…”
mentioning
confidence: 99%
“…, x n ) ∈ PS(α) n satisfying this equation. In this article, we investigate the solvability in PS(α) of linear Diophantine equations (1.1) ax + by = cz for all fixed a, b, c ∈ N. For example, the solvability of the equation y = θx + η for θ, η ∈ R with θ ∈ {0, 1} has been studied by Glasscock [Gla17,Gla20]. He asserts that if the equation y = θx+η has infinitely many solutions (x, y) ∈ N 2 , then for Lebesgue-a.e.…”
mentioning
confidence: 99%