On other two representations of the C-recursive integer sequences by terms in modular arithmetic

IF 0.6 4区 数学 Q4 COMPUTER SCIENCE, THEORY & METHODS Journal of Symbolic Computation Pub Date : 2025-02-19 DOI:10.1016/j.jsc.2025.102433
Mihai Prunescu
{"title":"On other two representations of the C-recursive integer sequences by terms in modular arithmetic","authors":"Mihai Prunescu","doi":"10.1016/j.jsc.2025.102433","DOIUrl":null,"url":null,"abstract":"<div><div>If <span><math><mi>s</mi><mo>∈</mo><msup><mrow><mi>N</mi></mrow><mrow><mi>N</mi></mrow></msup></math></span> is a sequence satisfying a recurrence rule of the form:<span><span><span><math><mi>s</mi><mo>(</mo><mi>n</mi><mo>+</mo><mi>d</mi><mo>)</mo><mo>+</mo><msub><mrow><mi>α</mi></mrow><mrow><mn>1</mn></mrow></msub><mi>s</mi><mo>(</mo><mi>n</mi><mo>+</mo><mi>d</mi><mo>−</mo><mn>1</mn><mo>)</mo><mo>+</mo><mo>…</mo><mo>+</mo><msub><mrow><mi>α</mi></mrow><mrow><mi>d</mi></mrow></msub><mi>s</mi><mo>(</mo><mi>n</mi><mo>)</mo><mo>=</mo><mn>0</mn></math></span></span></span> with coefficients <span><math><msub><mrow><mi>α</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>∈</mo><mi>Z</mi></math></span>, then there exist <span><math><mi>b</mi><mo>,</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>∈</mo><mi>N</mi></math></span> such that for all <span><math><mi>n</mi><mo>≥</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>0</mn></mrow></msub></math></span> the following representations work:<span><span><span><math><mi>s</mi><mo>(</mo><mi>n</mi><mo>)</mo><mo>=</mo><mrow><mo>⌊</mo><mfrac><mrow><mo>[</mo><msup><mrow><mi>b</mi></mrow><mrow><mi>n</mi><mo>(</mo><mi>d</mi><mo>−</mo><mn>2</mn><mo>)</mo><mo>+</mo><mo>⌈</mo><mi>n</mi><mo>/</mo><mn>2</mn><mo>⌉</mo></mrow></msup><mo>+</mo><mi>A</mi><mo>(</mo><mi>b</mi><mo>,</mo><mi>n</mi><mo>)</mo><mo>]</mo><mspace></mspace><mrow><mi>mod</mi></mrow><mspace></mspace><mi>B</mi><mo>(</mo><mi>b</mi><mo>,</mo><mi>n</mi><mo>)</mo></mrow><mrow><msup><mrow><mi>b</mi></mrow><mrow><mo>(</mo><mi>d</mi><mo>−</mo><mn>1</mn><mo>)</mo><mi>n</mi></mrow></msup></mrow></mfrac><mo>⌋</mo></mrow><mo>,</mo></math></span></span></span><span><span><span><math><mi>s</mi><mo>(</mo><mi>n</mi><mo>)</mo><mo>=</mo><mfrac><mrow><mn>1</mn></mrow><mrow><mo>|</mo><msub><mrow><mi>α</mi></mrow><mrow><mi>d</mi></mrow></msub><mo>|</mo></mrow></mfrac><mrow><mo>{</mo><mrow><mo>[</mo><mrow><mo>(</mo><msup><mrow><mi>b</mi></mrow><mrow><mi>n</mi><mo>(</mo><mi>d</mi><mo>−</mo><mn>1</mn><mo>)</mo><mo>+</mo><mrow><mo>⌈</mo><mi>n</mi><mo>/</mo><mn>2</mn><mo>⌉</mo></mrow></mrow></msup><mo>−</mo><msup><mrow><mi>b</mi></mrow><mrow><mi>n</mi></mrow></msup><mi>sgn</mi><mo>(</mo><msub><mrow><mi>α</mi></mrow><mrow><mi>d</mi></mrow></msub><mo>)</mo><mi>A</mi><mo>(</mo><mi>b</mi><mo>,</mo><mi>n</mi><mo>)</mo><mo>)</mo></mrow></mrow></mrow><mspace></mspace><mspace></mspace><mrow><mi>mod</mi></mrow><mspace></mspace><mi>B</mi><mo>(</mo><mi>b</mi><mo>,</mo><mi>n</mi><mo>)</mo><mo>]</mo><mspace></mspace><mrow><mi>mod</mi></mrow><mspace></mspace><msup><mrow><mi>b</mi></mrow><mrow><mi>n</mi></mrow></msup><mo>}</mo><mo>.</mo></math></span></span></span> Here <span><math><mi>A</mi><mo>(</mo><mi>b</mi><mo>,</mo><mi>n</mi><mo>)</mo></math></span> and <span><math><mi>B</mi><mo>(</mo><mi>b</mi><mo>,</mo><mi>n</mi><mo>)</mo></math></span> are polynomials with integer coefficients in <span><math><msup><mrow><mi>b</mi></mrow><mrow><mi>n</mi></mrow></msup></math></span>. They can be obtained by writing:<span><span><span><math><msup><mrow><mi>b</mi></mrow><mrow><msup><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msup></mrow></msup><mi>f</mi><mo>(</mo><msup><mrow><mi>b</mi></mrow><mrow><mo>−</mo><mi>n</mi></mrow></msup><mo>)</mo><mo>=</mo><mfrac><mrow><mi>A</mi><mo>(</mo><mi>b</mi><mo>,</mo><mi>n</mi><mo>)</mo></mrow><mrow><mi>B</mi><mo>(</mo><mi>b</mi><mo>,</mo><mi>n</mi><mo>)</mo></mrow></mfrac><mo>,</mo></math></span></span></span> where the rational function <span><math><mi>f</mi><mo>(</mo><mi>z</mi><mo>)</mo></math></span> is the generating function of the sequence <span><math><mo>(</mo><mi>s</mi><mo>(</mo><mi>n</mi><mo>)</mo><mo>)</mo></math></span>. If <span><math><mi>s</mi><mo>∈</mo><msup><mrow><mi>Z</mi></mrow><mrow><mi>N</mi></mrow></msup></math></span>, then <em>s</em> can be represented as the difference between any of the representations above for the sequence <span><math><mo>(</mo><mi>s</mi><mo>(</mo><mi>n</mi><mo>)</mo><mo>+</mo><msup><mrow><mi>c</mi></mrow><mrow><mi>n</mi><mo>+</mo><mn>1</mn></mrow></msup><mo>)</mo></math></span> which belongs to <span><math><msup><mrow><mi>N</mi></mrow><mrow><mi>N</mi></mrow></msup></math></span> and the geometric progression <span><math><msup><mrow><mi>c</mi></mrow><mrow><mi>n</mi><mo>+</mo><mn>1</mn></mrow></msup></math></span>. Here <span><math><mi>c</mi><mo>∈</mo><mi>N</mi></math></span> is a sufficiently large constant.</div></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"130 ","pages":"Article 102433"},"PeriodicalIF":0.6000,"publicationDate":"2025-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Symbolic Computation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S074771712500015X","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

If sNN is a sequence satisfying a recurrence rule of the form:s(n+d)+α1s(n+d1)++αds(n)=0 with coefficients αiZ, then there exist b,n0N such that for all nn0 the following representations work:s(n)=[bn(d2)+n/2+A(b,n)]modB(b,n)b(d1)n,s(n)=1|αd|{[(bn(d1)+n/2bnsgn(αd)A(b,n))modB(b,n)]modbn}. Here A(b,n) and B(b,n) are polynomials with integer coefficients in bn. They can be obtained by writing:bn2f(bn)=A(b,n)B(b,n), where the rational function f(z) is the generating function of the sequence (s(n)). If sZN, then s can be represented as the difference between any of the representations above for the sequence (s(n)+cn+1) which belongs to NN and the geometric progression cn+1. Here cN is a sufficiently large constant.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
如果 s∈NN 是一个满足递推规则的序列,其形式为:s(n+d)+α1s(n+d-1)+...+αds(n)=0,系数 αi∈Z,那么存在 b,n0∈N,使得对于所有 n≥n0,以下表示有效:s(n)=⌊[bn(d-2)+⌈n/2⌉+A(b,n)]modB(b,n)b(d-1)n⌋,s(n)=1|αd|{[(bn(d-1)+⌈n/2⌉-bnsgn(αd)A(b,n))modB(b,n)]modbn}。这里的 A(b,n) 和 B(b,n) 是在 bn 中具有整数系数的多项式。它们可以写成:bn2f(b-n)=A(b,n)B(b,n),其中有理函数 f(z) 是序列 (s(n)) 的生成函数。如果 s∈ZN,那么 s 可以表示为属于 NN 的序列(s(n)+cn+1)的上述任意表示法与几何级数 cn+1 之间的差。这里 c∈N 是一个足够大的常数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Symbolic Computation
Journal of Symbolic Computation 工程技术-计算机:理论方法
CiteScore
2.10
自引率
14.30%
发文量
75
审稿时长
142 days
期刊介绍: An international journal, the Journal of Symbolic Computation, founded by Bruno Buchberger in 1985, is directed to mathematicians and computer scientists who have a particular interest in symbolic computation. The journal provides a forum for research in the algorithmic treatment of all types of symbolic objects: objects in formal languages (terms, formulas, programs); algebraic objects (elements in basic number domains, polynomials, residue classes, etc.); and geometrical objects. It is the explicit goal of the journal to promote the integration of symbolic computation by establishing one common avenue of communication for researchers working in the different subareas. It is also important that the algorithmic achievements of these areas should be made available to the human problem-solver in integrated software systems for symbolic computation. To help this integration, the journal publishes invited tutorial surveys as well as Applications Letters and System Descriptions.
期刊最新文献
Proof of some conjectural congruences involving products of two binomial coefficients On other two representations of the C-recursive integer sequences by terms in modular arithmetic A propositional encoding for first-order clausal entailment over infinitely many constants Congruence properties for Schmidt type d-fold partition diamonds Reduction systems and degree bounds for integration
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1