On the use of gröbner bases for computing the structure of finite abelian groups

Authors:
M. Borges-Quintana;M. A. Borges-Trenard;E. Martínez-Moro
Affiliations:
Dpto. de Matemática, FCMC, U. de Oriente, Santiago de Cuba, Cuba;Dpto. de Matemática, FCMC, U. de Oriente, Santiago de Cuba, Cuba;Dpto. de Matemática Aplicada, U. de Valladolid, Spain
Venue:
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Year:
2005

Citing 12
Cited 2

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 Journal on Computing
An introduction to commutative and noncommutative Gro¨bner bases

Selected papers of the second international colloquium on Words, languages and combinatorics
A course in computational algebraic number theory

A course in computational algebraic number theory
Near optimal algorithms for computing Smith normal forms of integer matrices

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Integer matrix diagonalization

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
On some computational problems in finite Abelian groups

Mathematics of Computation
A space efficient algorithm for group structure computation

Mathematics of Computation
The Pohlig-Hellman method generalized for group structure computation

Journal of Symbolic Computation
Algorithmic methods for finitely generated Abelian groups

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the second Magma conference
On efficient sparse integer matrix Smith normal form computations

Journal of Symbolic Computation - Special issue on computer algebra and mechanized reasoning: selected St. Andrews' ISSAC/Calculemus 2000 contributions
On the computation of elementary divisors of integer matrices

Journal of Symbolic Computation
On computing the determinant and Smith form of an integer matrix

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science

An algorithm for computing a basis of a finite abelian group

CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Linear time algorithms for the basis of abelian groups

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics

Quantified Score

Hi-index	0.00

Visualization

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.