AbstractRecently, we developed practical algorithms to determine up to isomorphism the groups of a given order. Here we describe details on the implementations and the applications of these methods. In particular, we report on the determination of the groups of order at most 1000 except 512 and 768
Let G be a finite group. The function ω()={() : ∈} assigns to G the set of orders of all elements...
AbstractWe analyze the structure of the groups of cube-free order and, based on this, we present an ...
This paper aims to treat a study on the order of every element in the higher even, odd and prime ord...
AbstractRecently, we developed practical algorithms to determine up to isomorphism the groups of a g...
In the present BsC thesis we deal with algebraic structures, called groups. A group is a set closed ...
AbstractFor any positive integer N, there are a finite number of non-isomorphic groups of order N. T...
We consider the problem of determining if two finite groups are isomorphic. The groups are assumed t...
AbstractWe consider the problem of determining if two finite groups are isomorphic. The groups are a...
AbstractWe1999 Academic Pressintroduce three practical algorithms to construct certain finite groups...
AbstractBuilding on earlier work, a new method for generating descriptions of p-groups is developed....
The classification of finite semigroups is difficult even for small orders because of their large nu...
Group theory and its applications are relevant in many areas of mathematics. Our project considers f...
Algorithms are described for the enumeration and recognition of groups whose order is a product of d...
Reprinted from American journal of mathematics, vol. XXXVIII, no. 2, 1916.Thesis (Ph.D.)--University...
In this paper we combine many of the standard and more recent algebraic techniques for testing isomo...
Let G be a finite group. The function ω()={() : ∈} assigns to G the set of orders of all elements...
AbstractWe analyze the structure of the groups of cube-free order and, based on this, we present an ...
This paper aims to treat a study on the order of every element in the higher even, odd and prime ord...
AbstractRecently, we developed practical algorithms to determine up to isomorphism the groups of a g...
In the present BsC thesis we deal with algebraic structures, called groups. A group is a set closed ...
AbstractFor any positive integer N, there are a finite number of non-isomorphic groups of order N. T...
We consider the problem of determining if two finite groups are isomorphic. The groups are assumed t...
AbstractWe consider the problem of determining if two finite groups are isomorphic. The groups are a...
AbstractWe1999 Academic Pressintroduce three practical algorithms to construct certain finite groups...
AbstractBuilding on earlier work, a new method for generating descriptions of p-groups is developed....
The classification of finite semigroups is difficult even for small orders because of their large nu...
Group theory and its applications are relevant in many areas of mathematics. Our project considers f...
Algorithms are described for the enumeration and recognition of groups whose order is a product of d...
Reprinted from American journal of mathematics, vol. XXXVIII, no. 2, 1916.Thesis (Ph.D.)--University...
In this paper we combine many of the standard and more recent algebraic techniques for testing isomo...
Let G be a finite group. The function ω()={() : ∈} assigns to G the set of orders of all elements...
AbstractWe analyze the structure of the groups of cube-free order and, based on this, we present an ...
This paper aims to treat a study on the order of every element in the higher even, odd and prime ord...
DOI
Add to ORKG