English

Elimination of unknowns for systems of algebraic differential-difference equations

Commutative Algebra 2020-11-17 v1 Dynamical Systems Logic

Abstract

We establish effective elimination theorems for differential-difference equations. Specifically, we find a computable function B(r,s)B(r,s) of the natural number parameters rr and ss so that for any system of algebraic differential-difference equations in the variables x=x1,,xq\mathbf{x} = x_1, \ldots, x_q and y=y1,,yr\mathbf{y} = y_1, \ldots, y_r each of which has order and degree in y\mathbf{y} bounded by ss over a differential-difference field, there is a non-trivial consequence of this system involving just the x\mathbf{x} variables if and only if such a consequence may be constructed algebraically by applying no more than B(r,s)B(r,s) iterations of the basic difference and derivation operators to the equations in the system. We relate this finiteness theorem to the problem of finding solutions to such systems of differential-difference equations in rings of functions showing that a system of differential-difference equations over C\mathbb{C} is algebraically consistent if and only if it has solutions in a certain ring of germs of meromorphic functions.

Keywords

Cite

@article{arxiv.1812.11390,
  title  = {Elimination of unknowns for systems of algebraic differential-difference equations},
  author = {Wei Li and Alexey Ovchinnikov and Gleb Pogudin and Thomas Scanlon},
  journal= {arXiv preprint arXiv:1812.11390},
  year   = {2020}
}