A zero-test for D-algebraic transseries
Shaoshi Chen, Hanqian Fang, Joris van der Hoeven

TL;DR
This paper introduces an algorithm to determine whether a polynomial relation holds among D-algebraic transseries solutions of differential equations, extending existing power series methods to a broader class of formal series.
Contribution
The paper develops a novel zero-test algorithm specifically for D-algebraic transseries, expanding the applicability of algebraic relation testing beyond power series.
Findings
Algorithm successfully tests polynomial relations among D-algebraic transseries.
Extends zero-test methods from power series to transseries.
Provides a computational tool for formal series solutions of differential equations.
Abstract
Consider formal power series that are defined as the solutions of a system of polynomial differential equations together with a sufficient number of initial conditions. Given , several algorithms have been proposed in order to test whether . In this paper, we present such an algorithm for the case where are so-called transseries instead of power series.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Advanced Differential Equations and Dynamical Systems · Coding theory and cryptography
