On the Dynamical Wilf-Zeilberger Problem
MetadataShow full item record
In this paper, we give an algorithmic solution to a dynamical analog of the problem of certifying combinatorial identities by Wilf-Zeilberger pairs. Given two sequences generated in a dynamical setting, we calculate an upper bound N ≥ 1 such that whenever the first N terms of the two sequences agree pairwise, the two sequences agree term-by-term. Then, we give an algorithm that can be used to check whether two such sequences agree term-by-term. Our methods are mainly based on the theory of Chow rings of algebraic varieties.
Cite this version of the work
Yuxuan Sun (2022). On the Dynamical Wilf-Zeilberger Problem. UWSpace. http://hdl.handle.net/10012/18543