Search arXivSearch

arXiv · math/0410082

Étude du cas rationnel de la théorie des formes linéaires de logarithmes. (French) [Study of the rational case of the theory of linear forms in logarithms]

Abstract

We establish new measures of linear independence of logarithms on commutative algebraic groups in the so-called \emph{rational case}. More precisely, let k be a number field and v_{0} be an arbitrary place of k. Let G be a commutative algebraic group defined over k and H be a connected algebraic subgroup of G. Denote by Lie(H) its Lie algebra at the origin. Let u\in Lie(G(C_{v_{0}})) a logarithm of a point p\in G(k). Assuming (essentially) that p is not a torsion point modulo proper connected algebraic subgroups of G, we obtain lower bounds for the distance from u to Lie(H)\otimes_{k} C_{v_{0}}. For the most part, they generalize the measures already known when G is a linear group. The main feature of these results is to provide a better dependence in the height Log a of p, removing a polynomial term in LogLog a. The proof relies on sharp estimates of sizes of formal subschemes associated to H (in the sense of J.-B. Bost) obtained from a lemma by M. Raynaud as well as an absolute Siegel lemma and, in the ultrametric case, a recent interpolation lemma by D. Roy.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Éric Gaudron. 2008-10-27. Étude du cas rationnel de la théorie des formes linéaires de logarithmes. (French) [Study of the rational case of the theory of linear forms in logarithms]. https://doi.org/10.1016/j.jnt.2007.08.001

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