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



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






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


Diskretnaya Matematika, 2017, Volume 29, Issue 4, Pages 41–58
DOI: https://doi.org/10.4213/dm1485
(Mi dm1485)
 

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

Estimate of the maximal cycle length in the graph of polynomial transformation of Galois–Eisenstein ring

O. A. Kozlitin

LLC "Certification Research Center", Moscow
Full-text PDF (463 kB) Citations (6)
References:
Abstract: The paper is concerned with polynomial transformations of a finite commutative local principal ideal of a ring (a finite commutative uniserial ring, a Galois–Eisenstein ring). It is shown that in the class of Galois–Eisenstein rings with equal cardinalities and nilpotency indexes over Galois rings there exist polynomial generators for which the period of the output sequence exceeds those of the output sequences of polynomial generators over other rings.
Keywords: polynomial transformation, period, finite commutative uniserial ring.
Received: 18.07.2017
English version:
Discrete Mathematics and Applications, 2018, Volume 28, Issue 6, Pages 345–358
DOI: https://doi.org/10.1515/dma-2018-0031
Bibliographic databases:
Document Type: Article
UDC: 519.216+512.552
Language: Russian
Citation: O. A. Kozlitin, “Estimate of the maximal cycle length in the graph of polynomial transformation of Galois–Eisenstein ring”, Diskr. Mat., 29:4 (2017), 41–58; Discrete Math. Appl., 28:6 (2018), 345–358
Citation in format AMSBIB
\Bibitem{Koz17}
\by O.~A.~Kozlitin
\paper Estimate of the maximal cycle length in the graph of polynomial transformation of Galois--Eisenstein ring
\jour Diskr. Mat.
\yr 2017
\vol 29
\issue 4
\pages 41--58
\mathnet{http://mi.mathnet.ru/dm1485}
\crossref{https://doi.org/10.4213/dm1485}
\elib{https://elibrary.ru/item.asp?id=30737798}
\transl
\jour Discrete Math. Appl.
\yr 2018
\vol 28
\issue 6
\pages 345--358
\crossref{https://doi.org/10.1515/dma-2018-0031}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000452905000001}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85058813677}
Linking options:
  • https://www.mathnet.ru/eng/dm1485
  • https://doi.org/10.4213/dm1485
  • https://www.mathnet.ru/eng/dm/v29/i4/p41
  • This publication is cited in the following 6 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:544
    Full-text PDF :49
    References:39
    First page:27
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024