AbstractWe describe the theoretical and practical details of an algorithm which can be used to decide whether two given presentations for finite p-groups present isomorphic groups. The approach adopted is to construct a canonical presentation for each group. A description of the automorphism group of the p -group is also constructed
AbstractA new method for computing the automorphism group of a finite permutation group and for test...
We consider the problem of determining if two finite groups are isomorphic. The groups are assumed t...
For a permutation group G acting on the set Ω we say that two strings x, y: Ω → {0, 1} are G-isomorp...
AbstractWe describe the theoretical and practical details of an algorithm which can be used to decid...
AbstractWe describe the theoretical and practical details of an algorithm which can be used to decid...
A new method for computing the automorphism group of a finite permutation group and for testing two ...
A polynomial-time isomorphism test for a class of groups, properly containing the class of Abelian g...
AbstractA polynomial time isomorphism test for a class of groups, properly containing the class of a...
A polynomial time isomorphism test for a class of groups, properly containing the class of abelian g...
Motivated by the desire for better isomorphism tests for finite groups, we present a polynomial-time...
AbstractA polynomial time isomorphism test for a class of groups, properly containing the class of a...
Abstract. In this paper we present an algorithm, called conauto-2.0, that can efficiently compute a ...
In this paper we combine many of the standard and more recent algebraic techniques for testing isomo...
AbstractWe consider the problem of determining if two finite groups are isomorphic. The groups are a...
We consider the problem of testing isomorphism of groups of order n given by Cayley tables. The triv...
AbstractA new method for computing the automorphism group of a finite permutation group and for test...
We consider the problem of determining if two finite groups are isomorphic. The groups are assumed t...
For a permutation group G acting on the set Ω we say that two strings x, y: Ω → {0, 1} are G-isomorp...
AbstractWe describe the theoretical and practical details of an algorithm which can be used to decid...
AbstractWe describe the theoretical and practical details of an algorithm which can be used to decid...
A new method for computing the automorphism group of a finite permutation group and for testing two ...
A polynomial-time isomorphism test for a class of groups, properly containing the class of Abelian g...
AbstractA polynomial time isomorphism test for a class of groups, properly containing the class of a...
A polynomial time isomorphism test for a class of groups, properly containing the class of abelian g...
Motivated by the desire for better isomorphism tests for finite groups, we present a polynomial-time...
AbstractA polynomial time isomorphism test for a class of groups, properly containing the class of a...
Abstract. In this paper we present an algorithm, called conauto-2.0, that can efficiently compute a ...
In this paper we combine many of the standard and more recent algebraic techniques for testing isomo...
AbstractWe consider the problem of determining if two finite groups are isomorphic. The groups are a...
We consider the problem of testing isomorphism of groups of order n given by Cayley tables. The triv...
AbstractA new method for computing the automorphism group of a finite permutation group and for test...
We consider the problem of determining if two finite groups are isomorphic. The groups are assumed t...
For a permutation group G acting on the set Ω we say that two strings x, y: Ω → {0, 1} are G-isomorp...
DOI
Add to ORKG