Search arXivSearch

arXiv · math/0503078

A note on simultaneous Diophantine approximation on planar curves

Abstract

Let $\cS_n(ψ_1,...,ψ_n)$ denote the set of simultaneously $(ψ_1,...,ψ_n)$--approximable points in $\R^n$ and $\cSM_n(ψ)$ denote the set of multiplicatively $ψ$--approximable points in $\R^n$. Let $\cM$ be a manifold in $\R^n$. The aim is to develop a metric theory for the sets $ \cM \cap \cS_n(ψ_1,...,ψ_n) $ and $ \cM \cap \cSM_n(ψ) $ analogous to the classical theory in which $\cM$ is simply $\R^n$. In this note, we mainly restrict our attention to the case that $\cM$ is a planar curve $\cC$. A complete Hausdorff dimension theory is established for the sets $ \cC \cap \cS_2(ψ_1,ψ_2) $ and $ \cC \cap \cSM_2(ψ) $. A divergent Khintchine type result is obtained for $\cC \cap \cS_2(ψ_1,ψ_2) $; i.e. if a certain sum diverges then the one--dimensional Lebesgue measure on $\cC$ of $\cC \cap \cS_2(ψ_1,ψ_2) $ is full. Furthermore, in the case that $\cC$ is a rational quadric the convergent Khintchine type result is obtained for both types of approximation. Our results for $\cC \cap \cS_2(ψ_1,ψ_2) $ naturally generalize the dimension and Lebesgue measure statements of \cite{BDV03}. Within the multiplicative framework, our results for $ \cC \cap \cSM_2(ψ)$ constitute the first of their type.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Victor Beresnevich, Sanju Velani. 2005-03-04. A note on simultaneous Diophantine approximation on planar curves. https://arxiv.org/abs/math/0503078

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT