Computing the structure of a finite abelian group
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.
- Computing a basis for a finite Abelian p-group
- Determining concepts by group membership
- On isomorphism testing of groups with normal Hall subgroups
- A Terr algorithm for computations in the infrastructure of real-quadratic number fields
- Efficient algorithms for the basis of finite abelian groups
- Succinct representation of finite abelian groups
- An Algorithm for Computing a Basis of a Finite Abelian Group
- Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations
- A generic approach to searching for Jacobians
- Structure computation and discrete logarithms in finite abelian \(p\)-groups
- Computing Hilbert class polynomials with the Chinese remainder theorem
- The infrastructure of a global field of arbitrary unit rank
- GAP algorithms for finite Abelian groups and applications.
- Factoring Groups Efficiently
- On some computational problems in finite abelian groups
- Computing normal integral bases of abelian number fields
- Subgroup lattice algorithms related to extending and lifting Abelian groups.
- Computer Algebra in Scientific Computing
- Linear and sublinear time algorithms for the basis of abelian groups
- On time-lock cryptographic assumptions in abelian hidden-order groups
- Computing the binomial part of a polynomial ideal
- Unconditional computation of the class groups of real quadratic fields
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)