Computing the structure of a finite abelian group

From MaRDI portal





The ``structure of a finite Abelian group is the decomposition as a direct product of cyclic groups. Calculating this structure can be hard if there are factors of high order -- this happens for example with class groups in number theory. Using the improved order algorithm of \textit{D. C. Terr} [Math. Comput. 69, No. 230, 767-773 (2000; Zbl 0940.68038)] the authors improve on the complexity result of \textit{J. Buchmann, M. J. Jacobson} jun. and \textit{E. Teske} [Math. Comput. 66, No. 220, 1663-1687 (1997; Zbl 0894.11050)]. They prove an improved complexity bound of \(O(|M|\sqrt{|G|})\) group operations (where \(M\) is the number of generators) and storage of \(O(\sqrt{|G|}) \) group elements. The paper is a pure complexity result and does not consider an implementation.











This page was built for publication: Computing the structure of a finite abelian group

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