Determining cyclicity of finite modules
classification
🧮 math.AC
keywords
finitealgorithmcommutativecycliccyclicitydeterminesdeterminingdeterministic
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.