Determining cyclicity of finite modules. (March 2016)

• Record Type: Journal Article
• Authors: Lenstra, H.W.; Silverberg, A.
• Is Part Of: Journal of symbolic computation. Volume 73(2016)
• Page Start: 153
• Page End: 156
• Publication Date: 2016-03
• Subjects: Algebraic algorithms -- Finite rings -- Cyclic modules; Mathematics -- Data processing -- Periodicals; Numerical analysis -- Data processing -- Periodicals; Automatic programming (Computer science) -- Periodicals; Mathématiques -- Informatique -- Périodiques; Analyse numérique -- Informatique -- Périodiques; Programmation automatique -- Périodiques; Automatic programming (Computer science); Mathematics -- Data processing; Numerical analysis -- Data processing; Periodicals; Electronic journals; 510.285
• DOI: 10.1016/j.jsc.2015.06.002
• Languages: English
• ISSNs: 0747-7171

Abstract

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.