Search arXivSearch

arXiv · 2511.06534

Linear independence of values of hypergeometric functions and arithmetic Gevrey series

Abstract

We prove new linear independence results for the values of generalized hypergeometric functions ${}_pF_q$ at several distinct algebraic points, over suitable algebraic number fields. Our approach provides a uniform construction of Padé approximants of type II, together with a novel non-vanishing argument for generalized Wronskians of Hermite type. This method applies uniformly across all parameter regimes. Even in the case $p = q+1$, we extend known results from single-point to multi-points settings over general number fields, in both complex and $p$-adic settings. When $p < q+1$, we establish linear independence results over arbitrary number fields; and for $p > q+1$, we confirm that the values do not satisfy global linear relations in the $p$-adic setting in a framework of arithmetic Gevrey series. The results generalize and strengthen earlier works, demonstrating the flexibility of our Padé construction for families of contiguous hypergeometric functions, through a new non-vanishing proof for the determinant, that is crucial for the universality.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sinnou David, Noriko Hirata-Kohno, Makoto Kawashima. 2026-07-03. Linear independence of values of hypergeometric functions and arithmetic Gevrey series. https://arxiv.org/abs/2511.06534

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