Show simple item record

dc.contributor.authorSun, Yuxuan
dc.date.accessioned2022-08-15 12:42:28 (GMT)
dc.date.available2022-08-15 12:42:28 (GMT)
dc.date.issued2022-08-15
dc.date.submitted2022-07-28
dc.identifier.urihttp://hdl.handle.net/10012/18543
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.en
dc.language.isoenen
dc.publisherUniversity of Waterlooen
dc.subjectalgebraic geometryen
dc.subjectintersection theoryen
dc.subjectWilf-Zeilberger pairsen
dc.subjectarithmetic dynamicsen
dc.subjectdynamically generated sequencesen
dc.subjectelliptic divisibility sequencesen
dc.titleOn the Dynamical Wilf-Zeilberger Problemen
dc.typeMaster Thesisen
dc.pendingfalse
uws-etd.degree.departmentPure Mathematicsen
uws-etd.degree.disciplinePure Mathematicsen
uws-etd.degree.grantorUniversity of Waterlooen
uws-etd.degreeMaster of Mathematicsen
uws-etd.embargo.terms0en
uws.contributor.advisorBell, Jason
uws.contributor.affiliation1Faculty of Mathematicsen
uws.published.cityWaterlooen
uws.published.countryCanadaen
uws.published.provinceOntarioen
uws.typeOfResourceTexten
uws.peerReviewStatusUnrevieweden
uws.scholarLevelGraduateen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


UWSpace

University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages