Search arXivSearch

arXiv · 2505.15744

Some questions in Diophantine approximation: real and p-adics

Abstract

The Weak approximation theorem describes the closure of $G(Q)$ inside $G(Q_p)$ as well as inside $G(R)$ for $G$ an algebraic group over $Q$; the closure is always an open normal subgroup with finite abelian quotient, and is well understood in a certain sense even if precise results are not always available (such as for tori!). In this paper, for a finitely generated subgroup $ L \subset G(Q)$ we consider the topological closure of $ L$ inside $G(Q_p)$ and $G(R)$. The paper is written mostly for $G$ a torus or an abelian variety, but eventually considers a variant of the question for $G$ a semisimple group. The paper is written with the wishful thinking that when dealing with questions on topological closure of algebraic points in an algebraic group defined over a number field, the simplest answers hold, a well-known principle known as ``Occum's razor''.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dipendra Prasad. 2025-05-21. Some questions in Diophantine approximation: real and p-adics. https://arxiv.org/abs/2505.15744

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