{"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 is a sequence satisfying a recurrence rule of the form: with coefficients , then there exist such that for all the following representations work: Here and are polynomials with integer coefficients in . They can be obtained by writing: where the rational function is the generating function of the sequence . If , then s can be represented as the difference between any of the representations above for the sequence which belongs to and the geometric progression . Here is a sufficiently large constant.
期刊介绍:
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.