77范文网 - 专业文章范例文档资料分享平台

Shift Equivalence of P-finite Sequences(13)

来源:网络收集 时间:2021-04-06 下载这篇文档 手机版
说明:文章内容仅供预览,部分内容可能不全,需要完整文档或者需要复制内容,请下载word后使用。下载word有问题请添加微信号:或QQ: 处理(尽可能给您提供完整文档),感谢您的支持与谅解。点击这里给我发消息

We present an algorithm which decides the shift equivalence problem for Pfinite 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 shi

1.Considertheresultantres(L1,L2)∈k(s)(n).ByProp.1,anontrivialgcrdappearspreciselyforthosevaluesofswheretheresultantvanishes.Sincetheresultantisarationalfunctioninsovera eldofcharacteristiczero,itcanonlyhavein nitelymanyintegerrootsifitisidenticallyzero.Then,however,alreadythegcrdoverk(s)(n)mustbenontrivial,againbyProp.1.

2.SinceLisarightdivisorofL1andL1doesnotinvolves,alsoLisfreeofs.( s)(s)( s)Furthermore,wehavethatL( s)=gcrd(L1,(L2)( s))=gcrd(L1,L2)isarightdivisorofL2∈k(n)[E]andthereforeitisfreeofs,too.ButLandL( s)canbesimulaniouslyfreeofsonlyiftheyarealsofreeofn.

ThedegeneratecasehappensifL:=gcrd(L1,L2)(computedink(s)(n)[E])isalreadyanannihilatorforbothf1,f2.Inthiscase,thesequencesf1,f2areC- niteandwecanproceedwithAlgorithm3.(s)(s)

4.2ThenondegenerateCase

(s)ThenondegeneratecasehappensifL:=gcrd(L1,L2)(computedink(s)(n)[E])isnot

anannihilatoroff1,f2.Inthiscase,inviewofLemma3,part2,itisnecessaryforevery(s)solutions∈oftheshiftequivalenceproblemthatgcrd(L1/L,L2/L)isnontrivial.ByProp.1,thishappenspreciselyfortheintegerrootsof

res(rquo(L1,L),rquo(L2,L))∈k(s,n),

whererquo(A,B)denotestherightquotientofA∈k(s)(n)[E]byB∈k(s)(n).ByLemma4,itfollowsthattheresultantisnotidenticallyzero,forotherwiseLwouldnot(s)bethegreatestcommonrightdivisorofL1andL2.Thustheresultantcanonlyhave nitelymanyrootsintheintegers,andtheshiftequivalenceproblemcanbesolvedbytryingeachofthem.(s)Alternatively,thevaluessforwhichrquo(L1,L)andrquo(L2,L)haveanontrivialgreatestcommonrightdivisorcouldalsobeobtainedbyane cientalgorithmduetoGlotov[11].(s)

4.3Summary

Puttingthingstogether,weobtainthefollowingalgorithmforsolvingtheshiftequivalenceproblemforP- nitesequences.

Algorithm4

INPUT:f1,f2:→k,speci edbyannihilatingoperatorsL1,L2∈k(n)[E]andsu -cientlymanyinitialvalues.

OUTPUT:alls∈suchthatf1=Esf2

1function

百度搜索“77cn”或“免费范文网”即可找到本站免费阅读全部范文。收藏本站方便下次阅读,免费范文网,提供经典小说教育文库Shift Equivalence of P-finite Sequences(13)在线全文阅读。

Shift Equivalence of P-finite Sequences(13).doc 将本文的Word文档下载到电脑,方便复制、编辑、收藏和打印 下载失败或者文档不完整,请联系客服人员解决!
本文链接:https://www.77cn.com.cn/wenku/jiaoyu/1215103.html(转载请注明文章来源)
Copyright © 2008-2022 免费范文网 版权所有
声明 :本网站尊重并保护知识产权,根据《信息网络传播权保护条例》,如果我们转载的作品侵犯了您的权利,请在一个月内通知我们,我们会及时删除。
客服QQ: 邮箱:tiandhx2@hotmail.com
苏ICP备16052595号-18
× 注册会员免费下载(下载后可以自由复制和排版)
注册会员下载
全站内容免费自由复制
注册会员下载
全站内容免费自由复制
注:下载文档有可能“只有目录或者内容不全”等情况,请下载之前注意辨别,如果您已付费且无法下载或内容有问题,请联系我们协助你处理。
微信: QQ: