AbstractWe present algorithms for computing intersections, normalizers and subgroup products of subgroups in finitely generated nilpotent groups given by nilpotent presentations. The problems are reduced to solving for certain minimal solutions in linear Diophantine equations over the integers. Performance of the algorithm using a Mathematica implementation is demonstrated
AbstractWe describe the theory and implementation of an algorithm for computing the normalizer of a ...
We formulate an algorithm for calculating a representation by unipotent matrices over the integers o...
AbstractThis paper describes algorithms for constructing a Hall π-subgroup H of a finite soluble gro...
AbstractWe present algorithms for computing intersections, normalizers and subgroup products of subg...
Let H and K be arbitrary subgroups of a finite soluble group G. The purpose of this paper is todescr...
Let H and K be arbitrary subgroups of a finite soluble group G. The purpose of this paper is todescr...
AbstractThis paper describes an algorithm for constructing certain important subgroup intersections ...
AbstractLetG,HandEbe subgroups of a finite nilpotent permutation group of degreen. We describe the t...
This thesis is concerned with computing invariants for finitely-presented nilpotent groups. Two main...
AbstractGiven a finite group G, we define the subgroup D(G) to be the intersection of the normalizer...
AbstractIf a finite group G is the product of two nilpotent subgroups A and B and if N is a minimal ...
If a finite group G is the product of two nilpotent subgroups A and B and if N is a minimal normal s...
This paper describes a new procedure, based on string rewriting rules, for verifying that a finitely...
AbstractWe formulate an algorithm for calculating a representation by unipotent matrices over the in...
this article. 0747--7171/90/000000 + 00 $03.00/0 c fl 1996 Academic Press Limited 2 E. M. Luks, F. ...
AbstractWe describe the theory and implementation of an algorithm for computing the normalizer of a ...
We formulate an algorithm for calculating a representation by unipotent matrices over the integers o...
AbstractThis paper describes algorithms for constructing a Hall π-subgroup H of a finite soluble gro...
AbstractWe present algorithms for computing intersections, normalizers and subgroup products of subg...
Let H and K be arbitrary subgroups of a finite soluble group G. The purpose of this paper is todescr...
Let H and K be arbitrary subgroups of a finite soluble group G. The purpose of this paper is todescr...
AbstractThis paper describes an algorithm for constructing certain important subgroup intersections ...
AbstractLetG,HandEbe subgroups of a finite nilpotent permutation group of degreen. We describe the t...
This thesis is concerned with computing invariants for finitely-presented nilpotent groups. Two main...
AbstractGiven a finite group G, we define the subgroup D(G) to be the intersection of the normalizer...
AbstractIf a finite group G is the product of two nilpotent subgroups A and B and if N is a minimal ...
If a finite group G is the product of two nilpotent subgroups A and B and if N is a minimal normal s...
This paper describes a new procedure, based on string rewriting rules, for verifying that a finitely...
AbstractWe formulate an algorithm for calculating a representation by unipotent matrices over the in...
this article. 0747--7171/90/000000 + 00 $03.00/0 c fl 1996 Academic Press Limited 2 E. M. Luks, F. ...
AbstractWe describe the theory and implementation of an algorithm for computing the normalizer of a ...
We formulate an algorithm for calculating a representation by unipotent matrices over the integers o...
AbstractThis paper describes algorithms for constructing a Hall π-subgroup H of a finite soluble gro...
DOI
Add to ORKG