arXiv Analytics

Sign in

arXiv:2310.12812 [math.CO]AbstractReferencesReviewsResources

Systems of Discrete Differential Equations, Constructive Algebraicity of the Solutions

Hadrien Notarantonio, Sergey Yurkevich

Published 2023-10-19Version 1

In this article, we study systems of $n \geq 1$, not necessarily linear, discrete differential equations (DDEs) of order $k \geq 1$ 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 $n=1$. 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.

Related articles: Most relevant | Search more
arXiv:2408.13755 [math.CO] (Published 2024-08-25)
On the Elementary Proof of the Inverse Erdős-Heilbronn Problem
arXiv:1310.5919 [math.CO] (Published 2013-10-19, updated 2014-10-09)
An Elementary Proof of the Hook Content Formula
arXiv:math/9808107 [math.CO] (Published 1998-08-25, updated 1998-08-28)
Elementary proofs of identities for Schur functions and plane partitions