Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Prikladnaya Diskretnaya Matematika, 2016, Number 1(31), Pages 57–61
DOI: https://doi.org/10.17223/20710410/31/5
(Mi pdm531)
 

This article is cited in 4 scientific papers (total in 4 papers)

Theoretical Foundations of Applied Discrete Mathematics

On the period length of vector sequences generated by polynomials modulo prime powers

N. G. Parvatov

National Research Tomsk State University, Tomsk, Russia
Full-text PDF (548 kB) Citations (4)
References:
Abstract: We give an upper bound on the period length for vector sequences defined recursively by systems of multivariate polynomials with coefficients in the ring of integers modulo a prime power.
Keywords: recurrence sequences, vector sequences, period length, polynomial functions, polynomial permutations, finite rings.
Bibliographic databases:
Document Type: Article
UDC: 511.176
Language: English
Citation: N. G. Parvatov, “On the period length of vector sequences generated by polynomials modulo prime powers”, Prikl. Diskr. Mat., 2016, no. 1(31), 57–61
Citation in format AMSBIB
\Bibitem{Par16}
\by N.~G.~Parvatov
\paper On the period length of vector sequences generated by polynomials modulo prime powers
\jour Prikl. Diskr. Mat.
\yr 2016
\issue 1(31)
\pages 57--61
\mathnet{http://mi.mathnet.ru/pdm531}
\crossref{https://doi.org/10.17223/20710410/31/5}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000408981400005}
Linking options:
  • https://www.mathnet.ru/eng/pdm531
  • https://www.mathnet.ru/eng/pdm/y2016/i1/p57
  • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:227
    Full-text PDF :84
    References:50
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024