Search arXivSearch

arXiv · 1805.00750

Hermite-Thue equation: Padé approximations and Siegel's lemma

Abstract

Padé approximations and Siegel's lemma are widely used tools in Diophantine approximation theory. This work has evolved from the attempts to improve Baker-type linear independence measures, either by using the Bombieri-Vaaler version of Siegel's lemma to sharpen the estimates of Padé-type approximations, or by finding completely explicit expressions for the yet unknown 'twin type' Hermite-Padé approximations. The appropriate homogeneous matrix equation representing both methods has an $M \times (L+1)$ coefficient matrix, where $M \le L$. The homogeneous solution vectors of this matrix equation give candidates for the Padé polynomials. Due to the Bombieri-Vaaler version of Siegel's lemma, the upper bound of the minimal non-zero solution of the matrix equation can be improved by finding the gcd of all the $M \times M$ minors of the coefficient matrix. In this paper we consider the exponential function and prove that there indeed exists a big common factor of the $M \times M$ minors, giving a possibility to apply the Bombieri-Vaaler version of Siegel's lemma. Further, in the case $M=L$, the existence of this common factor is a step towards understanding the nature of the 'twin type' Hermite-Padé approximations to the exponential function.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tapani Matala-aho, Louna Seppälä. 2018-05-02. Hermite-Thue equation: Padé approximations and Siegel's lemma. https://doi.org/10.1016/j.jnt.2018.03.014

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