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

DOI10.1515/dma-2018-0031zbMath1408.13066OpenAlexW2904304159WikidataQ128785370 ScholiaQ128785370MaRDI QIDQ1741468

Oleg A. Kozlitin

Publication date: 3 May 2019

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2018-0031

zbMATH Keywords

periodpolynomial transformationfinite commutative uniserial ring

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Polynomials and finite commutative rings (13M10)

Cites Work

• Uniformly distributed sequences in computer algebra or how to construct program generators of random numbers
• On the structure of digraphs of polynomial transformations over finite commutative rings with unity
• On the structure of finite commutative rings with an identity
• FINITE PRINCIPAL IDEAL RINGS
• Transitive polynomial transformations of residue class rings
• Цикловая структура полиномиального генератора над кольцом Галуа
• О строении графа полиномиального преобразования кольца Галуа

This page was built for publication: Estimate of the maximal cycle length in the graph of polynomial transformation of Galois-Eisenstein ring