SOLVING DIFFERENCE EQUATIONS IN SEQUENCES: UNIVERSALITY AND UNDECIDABILITY
Keyword(s):
We study solutions of difference equations in the rings of sequences and, more generally, solutions of equations with a monoid action in the ring of sequences indexed by the monoid. This framework includes, for example, difference equations on grids (for example, standard difference schemes) and difference equations in functions on words. On the universality side, we prove a version of strong Nullstellensatz for such difference equations under the assumption that the cardinality of the ground field is greater than the cardinality of the monoid and construct an example showing that this assumption cannot be omitted. On the undecidability side, we show that the following problems are undecidable:
1998 ◽
Vol 92
(2-3)
◽
pp. 101-123
◽
2006 ◽
Vol 6
(3)
◽
pp. 269-290
◽
1991 ◽
Vol 118
(1-2)
◽
pp. 139-151
◽
1974 ◽
Vol 17
(3)
◽
pp. 397-401
◽
1939 ◽
Vol 35
(4)
◽
pp. 548-561
◽
1925 ◽
Vol 44
◽
pp. 242-247
◽
Keyword(s):