Geodesic
Shift equivalence of P-finite sequences
The electronic journal of combinatorics, Tome 13 (2006)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl EuDML
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.
DOI : 10.37236/1126
Classification : 68W30 
Manuel Kauers. Shift equivalence of P-finite sequences. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1126
@article{10_37236_1126,
     author = {Manuel Kauers},
     title = {Shift equivalence of {P-finite} sequences},
     journal = {The electronic journal of combinatorics},
     year = {2006},
     volume = {13},
     doi = {10.37236/1126},
     zbl = {1113.68111},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1126/}
}
TY  - JOUR
AU  - Manuel Kauers
TI  - Shift equivalence of P-finite sequences
JO  - The electronic journal of combinatorics
PY  - 2006
VL  - 13
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1126/
DO  - 10.37236/1126
ID  - 10_37236_1126
ER  - 
%0 Journal Article
%A Manuel Kauers
%T Shift equivalence of P-finite sequences
%J The electronic journal of combinatorics
%D 2006
%V 13
%U http://geodesic.mathdoc.fr/articles/10.37236/1126/
%R 10.37236/1126
%F 10_37236_1126

Cité par Sources :