Abstract
Some algorithmic properties are obtained related with the computation of the elementary divisors and a set of canonical generators of a finite abelian group, this properties are based on Gröbner bases techniques used as a theoretical framework. As an application a new algorithm for computing the structure of the abelian group is presented.
Keywords
- Abelian Group
- Great Common Divisor
- Elementary Divisor
- Residue Number System
- Canonical Structure
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Borges Quintana, M.: On some Gröbner Bases Techniques and their Applications (Spanish). Phd Thesis. Universidad de Oriente, Santiago de Cuba, Cuba (2002)
Buchberger, B., Winkler, F.: Gröbner Bases and Applications. In: Proc. of the International Conference 33 Years of Gröbner Bases. London Mathematical Society Series, vol. 251. Cambridge University Press, Cambridge (1998)
Buchberger, B.: Introduction to Gröbner Bases. In: [2], pp. 3–31 (1998)
Buchmann, J., Jacobson Jr., M.J., Teske, E.: On Some Computational Problems in Finite Abelian Groups. Math. Comput. 66(220), 1663–1687 (1997)
Cohen, H.: A Course in Computational Algebraic Number Theory (3rd corrected printing), New York. Graduate Texts in Mathematics, vol. 138. Springer, Heidelberg (1996)
Cohen, H., Díaz y Díaz, F., Olivier, M.: Algorithmic Methods for Finitely Generated Abelian Groups. J. Symbolic Computation 31(1-2), 133–147 (2001)
Dumas, J.G., Saunders, B.D., Villard, G.: On Efficient Sparse Integer Matrix Smith Normal Form Computations. J. Symbolic Computation 32(1-2), 71–99 (2001)
Eberly, W., Giesbrecht, M.W., Villard, G.: Computing the determinant and Smith form of an integer matrix. In: The 41st Annual IEEE Symposium on Foundations of Computer Science, Redondo Beach, CA (2000)
Havas, G., Majewski, B.S.: Integer Matrix Diagonalization. J. Symbolic Computation 24(3-4), 399–408 (1997)
Iliopoulos, C.S.: Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix. Siam J. Comput. 18/4, 658–669 (1989)
Lübeck, F.: On the Computation of Elementary Divisors of Integer Matrices. J. Symbolic Computation 33(1), 57–65 (2002)
Mora, T.: An Introduction to Commutative and Noncommutative Gröbner Bases. Theoretical Computer Science 134, 131–173 (1994)
Storjohann, A.: Near optimal algorithms for computing Smith normal forms of integer matrices. In: Lakshman, Y.N. (ed.) ISSAC 1996: Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, Zurich, Switzerland, July 24-26, 1996, pp. 267–274. ACM Press, New York (1996)
Storjohann, A.: Algorithms for Matrix Canonical Forms. Ph.D. Thesis, Institut für Wissenschaftliches Rechnen, ETH-Zentrum, Zürich, Switzerland (2000)
Terras, A.: Fourier analysis on finite groups and applications. LMS Student Texts, 43. Cambridge University Press, Cambridge (1999)
Teske, E.: A Space Efficient Algorithm for Group Structure Computation. Math. Comput. 67, 1637–1663 (1998)
Teske, E.: The Pohlig-Hellman Method Generalized for Group Structure Computation. J. Symbolic Computation 27(6), 521–534 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borges-Quintana, M., Borges-Trenard, M.A., Martínez-Moro, E. (2005). On the Use of Gröbner Bases for Computing the Structure of Finite Abelian Groups. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2005. Lecture Notes in Computer Science, vol 3718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11555964_5
Download citation
DOI: https://doi.org/10.1007/11555964_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28966-1
Online ISBN: 978-3-540-32070-8
eBook Packages: Computer ScienceComputer Science (R0)
