The Libraries will be performing routine maintenance on UWSpace on October 13th, 2025, from 8 - 9 am ET. UWSpace will be unavailable during this time. Service should resume by 9 am ET.
 

On the Dynamical Wilf-Zeilberger Problem

Loading...
Thumbnail Image

Date

2022-08-15

Authors

Sun, Yuxuan

Advisor

Bell, Jason

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

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.

Description

Keywords

algebraic geometry, intersection theory, Wilf-Zeilberger pairs, arithmetic dynamics, dynamically generated sequences, elliptic divisibility sequences

LC Subject Headings

Citation