Practical methods for computing equivalent forms of integer matrices are presented. Both heuristic and modular techniques are used to overcome integer overflow problems, and have successfully handled matrices with hundreds of rows and columns. Applications to finding the structure of finitely presented abelian groups are described
We define a refutationally complete superposition calculus specialized for abelian groups represente...
AbstractThe relative complexity of the following problems on abelian groups represented by an explic...
AbstractFinitely generated Z-modules have canonical decompositions. When such modules are given in a...
Abstract. An O(s5M($2)) algorithm for computing the canonical structure of a finite Abelian group re...
Summary. The basic conceptions of matrix algebra are introduced. The matrix is introduced as the fin...
Let G be a finitely presented group. This paper describes the theory and practice of a method for ob...
AbstractLetGbe a finitely presented group. This paper describes the theory and practice of a method ...
AbstractWe study the algebra of the arithmetic of integer matrices. A link is established between th...
AbstractIn this paper we describe a new algorithm for constructing a representation by integer matri...
The purpose of this project is to introduce another method of working with groups, that is more effi...
We consider algorithms for computing the Smith normal form of integer matrices. A variety of differe...
Let G be a finitely presented group. This paper describes the theory and practice of a method for o...
Abstract. We present an algorithm that computes the structure of a finite abelian group G from a gen...
Finitely generated Z-modules have canonical decompositions. When such modules are given in a finitel...
AbstractWe define a refutationally complete superposition calculus specialized for abelian groups re...
We define a refutationally complete superposition calculus specialized for abelian groups represente...
AbstractThe relative complexity of the following problems on abelian groups represented by an explic...
AbstractFinitely generated Z-modules have canonical decompositions. When such modules are given in a...
Abstract. An O(s5M($2)) algorithm for computing the canonical structure of a finite Abelian group re...
Summary. The basic conceptions of matrix algebra are introduced. The matrix is introduced as the fin...
Let G be a finitely presented group. This paper describes the theory and practice of a method for ob...
AbstractLetGbe a finitely presented group. This paper describes the theory and practice of a method ...
AbstractWe study the algebra of the arithmetic of integer matrices. A link is established between th...
AbstractIn this paper we describe a new algorithm for constructing a representation by integer matri...
The purpose of this project is to introduce another method of working with groups, that is more effi...
We consider algorithms for computing the Smith normal form of integer matrices. A variety of differe...
Let G be a finitely presented group. This paper describes the theory and practice of a method for o...
Abstract. We present an algorithm that computes the structure of a finite abelian group G from a gen...
Finitely generated Z-modules have canonical decompositions. When such modules are given in a finitel...
AbstractWe define a refutationally complete superposition calculus specialized for abelian groups re...
We define a refutationally complete superposition calculus specialized for abelian groups represente...
AbstractThe relative complexity of the following problems on abelian groups represented by an explic...
AbstractFinitely generated Z-modules have canonical decompositions. When such modules are given in a...
DOI
Add to ORKG