AbstractWe formulate an algorithm for calculating a representation by unipotent matrices over the integers of a finitely-generated torsion-free nilpotent group given by a polycyclic presentation. The algorithm works along a polycyclic series of the group, each step extending a representation of an element of that series to the next element
AbstractWe describe practical algorithms for computing a polycyclic presentation and for facilitatin...
AbstractWe study and describe faithful affine representations of a certain canonical form for torsio...
This thesis concerns representation growth of finitely generated torsion-free nilpotent groups. This...
We formulate an algorithm for calculating a representation by unipotent matrices over the integers o...
AbstractWe present an algorithm for calculating a representation by unitriangular matrices over the ...
AbstractIn this paper we describe a new algorithm for constructing a representation by integer matri...
AbstractWe present an algorithm for calculating a representation by unitriangular matrices over the ...
AbstractIn this paper we describe a new algorithm for constructing a representation by integer matri...
This thesis is concerned with computing invariants for finitely-presented nilpotent groups. Two main...
Mal'cev showed in the 1950s that there is a correspondence between radicable torsion-free nilpotent ...
Mal'cev showed in the 1950s that there is a correspondence between radicable torsion-free nilpotent ...
This paper discusses the practical problems associated with developing a computerimplementation of a...
This paper describes a new procedure, based on string rewriting rules, for verifying that a finitely...
AbstractLet G be a finite group. It is easy to compute the character of G corresponding to a given c...
AbstractWe describe effective algorithms for computing a polycyclic presentation of the Schur multip...
AbstractWe describe practical algorithms for computing a polycyclic presentation and for facilitatin...
AbstractWe study and describe faithful affine representations of a certain canonical form for torsio...
This thesis concerns representation growth of finitely generated torsion-free nilpotent groups. This...
We formulate an algorithm for calculating a representation by unipotent matrices over the integers o...
AbstractWe present an algorithm for calculating a representation by unitriangular matrices over the ...
AbstractIn this paper we describe a new algorithm for constructing a representation by integer matri...
AbstractWe present an algorithm for calculating a representation by unitriangular matrices over the ...
AbstractIn this paper we describe a new algorithm for constructing a representation by integer matri...
This thesis is concerned with computing invariants for finitely-presented nilpotent groups. Two main...
Mal'cev showed in the 1950s that there is a correspondence between radicable torsion-free nilpotent ...
Mal'cev showed in the 1950s that there is a correspondence between radicable torsion-free nilpotent ...
This paper discusses the practical problems associated with developing a computerimplementation of a...
This paper describes a new procedure, based on string rewriting rules, for verifying that a finitely...
AbstractLet G be a finite group. It is easy to compute the character of G corresponding to a given c...
AbstractWe describe effective algorithms for computing a polycyclic presentation of the Schur multip...
AbstractWe describe practical algorithms for computing a polycyclic presentation and for facilitatin...
AbstractWe study and describe faithful affine representations of a certain canonical form for torsio...
This thesis concerns representation growth of finitely generated torsion-free nilpotent groups. This...