Search arXivSearch

arXiv · 2209.03301

On Abel's problem and Gauss congruences

Abstract

A classical problem due to Abel is to determine if a differential equation $y'=ηy$ admits a non-trivial solution $y$ algebraic over $\mathbb C(x)$ when $η$ is a given algebraic function over $\mathbb C(x)$. Risch designed an algorithm that, given $η$, determines whether there exists an algebraic solution or not. In this paper, we adopt a different point of view when $η$ admits a Puiseux expansion with rational coefficients at some point in $\mathbb C\cup \{\infty\}$, which can be assumed to be 0 without loss of generality. We prove the following arithmetic characterization: there exists a non-trivial algebraic solution of $y'=ηy$ if and only if the coefficients of the Puiseux expansion of $xη(x)$ at $0$ satisfy Gauss congruences for almost all prime numbers. We then apply our criterion to hypergeometric series: we completely determine the equations $y'=ηy$ with an algebraic solution when $xη(x)$ is an algebraic hypergeometric series with rational parameters, and this enables us to prove a prediction Golyshev made using the theory of motives. We also present three other applications, in particular to diagonals of rational fractions and to directed two-dimensional walks.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

É. Delaygue, T. Rivoal. 2023-04-19. On Abel's problem and Gauss congruences. https://arxiv.org/abs/2209.03301

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