vix.ing · top · new · best · stats

On deciding transcendence of power series

2025/04/23 by Alin Bostan, Bruno Salvy, Bostan, Alin +3 · 3 voices · 4 citations
Computer Science · Mathematics · #11J81 #16S32 #34M15 #Classical Analysis and ODEs (math.CA) #FOS: Computer and information sciences #FOS: Mathematics #Number Theory (math.NT) #Polynomial and algebraic computation #Symbolic Computation (cs.SC) #cs.SC #math.CA #math.NT

paper · pdf · doi:10.48550/arxiv.2504.16697

openalex publication_date 2025/04/23 · arxiv published 2025/04/23 · arxiv updated 2025/04/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

It is well known that algebraic power series are differentially finite (D-finite): they satisfy linear differential equations with polynomial coefficients. The converse problem, whether a given D-finite power series is algebraic or transcendental, is notoriously difficult. We prove that this problem is decidable: we give two theoretical algorithms and a transcendence test that is efficient in practice.

Citations

Cited by

Discussions

Related