Determining cyclicity of finite modules

DOI10.1016/J.JSC.2015.06.002MaRDI QIDQ491255zbMATH OpenOpenAlexFDO

Authors H. W. jun. Lenstra, Alice Silverberg

Publication date 24 August 2015

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1501.00183

zbMATH Keywords

finite ringsalgebraic algorithmscyclic modules

Mathematics Subject Classification ID

Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Commutative Artinian rings and modules, finite-dimensional algebras (13E10) Commutative rings and modules of finite generation or presentation; number of generators (13E15)

Abstract: We present a deterministic polynomial-time algorithm that determines whether a finite module over a finite commutative ring is cyclic, and if it is, outputs a generator.

Recommendations

• On recognizing cyclic modules effectively
• Dynamics of linear systems over finite commutative rings
• The module isomorphism problem reconsidered.
• Testing isomorphism of modules.
• Basic algorithms for manipulation of modules over finite chain rings

Cites work

• scientific article; zbMATH DE number 5532102 (Why is no real title available?)
• scientific article; zbMATH DE number 3279238 (Why is no real title available?)
• Revisiting the Gentry-Szydlo Algorithm

Cited in

(4)

• scientific article; zbMATH DE number 421637 (Why is no real title available?)
• Testing isomorphism of lattices over CM-orders
• Lattices with symmetry
• On recognizing cyclic modules effectively

This page was built for publication: Determining cyclicity of finite modules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q491255)