Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Linear independence of values of G-functions (1701.09051v1)

Published 31 Jan 2017 in math.NT

Abstract: Given any non-polynomial $G$-function $F(z)=\sum_{k=0}\infty A_k zk$ of radius of convergence $R$, we consider the $G$-functions $F_n{[s]}(z)=\sum_{k=0}\infty \frac{A_k}{(k+n)s}zk$ for any integers $s\geq 0$ and $n\geq 1$. For any fixed algebraic number $\alpha$ such that $0 \textless{} \vert \alpha \vert \textless{} R$ and any number field $\mathbb{K}$ containing $\alpha$ and the $A_k$'s, we define $\Phi_{\alpha, S}$ as the $\mathbb{K}$-vector space generated by the values $F_n{[s]}(\alpha)$, $n\ge 1$ and $0\leq s\leq S$. We prove that $u_{\mathbb{K},F}\log(S)\leq \dim_{\mathbb{K}}(\Phi_{\alpha, S})\leq v_F S$ for any $S$, with effective constants $u_{\mathbb{K},F}\textgreater{}0$ and $v_F\textgreater{}0$, and that the family $(F_n{[s]}(\alpha))_{1\le n \le v_F, s \ge 0}$ contains infinitely many irrational numbers. This theorem applies in particular when $F$ is an hypergeometric series with rational parameters or a multiple polylogarithm, and it encompasses a previous result by the second author and Marcovecchio in the case of polylogarithms. The proof relies on an explicit construction of Pad\'e-type approximants. It makes use of results of Andr\'e, Chudnovsky and Katz on $G$-operators, of a new linear independence criterion `a la Nesterenko over number fields, of singularity analysis as well as of the saddle point method.

Summary

We haven't generated a summary for this paper yet.