Systems of Discrete Differential Equations, Constructive Algebraicity of the Solutions
Combinatorics
2024-11-13 v2 Computational Complexity
Abstract
In this article, we study systems of , not necessarily linear, discrete differential equations (DDEs) of order with one catalytic variable. We provide a constructive and elementary proof of algebraicity of the solutions of such equations. This part of the present article can be seen as a generalization of the pioneering work by Bousquet-M\'elou and Jehanne (2006) who settled down the case . Moreover, we obtain effective bounds for the algebraicity degrees of the solutions and provide an algorithm for computing annihilating polynomials of the algebraic series. Finally, we carry out a first analysis in the direction of effectivity for solving systems of DDEs in view of practical applications.
Cite
@article{arxiv.2310.12812,
title = {Systems of Discrete Differential Equations, Constructive Algebraicity of the Solutions},
author = {Hadrien Notarantonio and Sergey Yurkevich},
journal= {arXiv preprint arXiv:2310.12812},
year = {2024}
}