Preprint icon

Preprint

D-algebraic guessing

Abstract:
Given finitely many consecutive terms of an infinite sequence, we discuss the construction of a polynomial difference equation that the sequence may satisfy. We also present a method to seek a candidate polynomial differential equation for its generating function. It appears that these methods often lead to effective D-algebraic operations.
Publication status:
Published
Peer review status:
Not peer reviewed

Actions

Access Document

Preprint server copy:
10.48550/arXiv.2510.26869

Authors

More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author


More from this funder
Funder identifier:
https://ror.org/001aqnf71
Grant:
EP/X033813/1
Programme:
UKRI Frontier Research Grant


Preprint server:
arXiv
Publication date:
2025-10-30
DOI:


Language:
English
Pubs id:
2305956
Local pid:
pubs:2305956
Deposit date:
2025-10-30
ARK identifier:

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP