Skip to main content
Article thumbnail
Location of Repository

Shift Equivalence of P-finite Sequences

By Manuel Kauers

Abstract

We present an algorithm which decides the shift equivalence problem for P-finite sequences. A sequence is called P-finite if it satisfies a homogeneous linear recurrence equation with polynomial coefficients. Two sequences are called shift equivalent if shifting one of the sequences s times makes it identical to the other, for some integer s. Our algorithm computes, for any two P-finite sequences, given via recurrence equation and initial values, all integers s such that shifting the first sequence s times yields the second.

Year: 2008
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.63
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.sfb013.uni-linz.ac.... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.