Abstract
dc:description.abstractIn 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.
Degree
thesis:*- Grantor dc:publisher
- University of Waterloo
- Year dc:date.issued
- 2022
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Sun, Yuxuan
- Advisor dc:contributor.advisor
-
- Bell, Jason
Subjects
dc:subject × 6Rights
- Language dc:language.iso
- en
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/10012/18543