Related papers: Complete Isocategorical Classification of Groups o…
We obtain a new classification of the finite metacyclic group in terms of group invariants. We present an algorithm to compute these invariants, and hence to decide if two given finite metacyclic groups are isomorphic, and another algorithm…
The groups whose orders factorise into at most four primes have been described (up to isomorphism) in various papers. Given such an order n, this paper exhibits a new explicit and compact determination of the isomorphism types of the groups…
This paper shows that groups of order $64$ are uniquely determined up to isomorphism by their Tables of Marks. This then resolves a previously posed question about whether all groups of order less than $96$ are determined by their Tables of…
Using the computational algebra system GAP (http://www.gap-system.org) and the GAP package LAGUNA (http://www.cs.st-andrews.ac.uk/~alexk/laguna.htm), we checked that all 2-groups of order not greater than 32 are determined by normalized…
The question of whether there exists a finite group of order at least three in which every element except one is a commutator has remained unresolved in group theory. In this article, we address this open problem by developing an…
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of…
Two groups are called isocategorical over a field $k$ if their respective categories of $k$-linear representations are monoidally equivalent. We classify isocategorical groups over arbitrary fields, extending the earlier classification of…
The class of all quasigroups is covered by six classes: the class of all asymmetric quasigroups and five varieties of quasigroups (commutative, left symmetric, right symmetric, semi-symmetric and totally symmetric). Each of these classes is…
We describe a new approach towards the systematic construction of finite groups up to isomorphism. This approach yields a practical algorithm for the construction of finite solvable groups up to isomorphism. We report on a GAP…
The mod-p cohomology ring of a non-trivial finite p-group is an infinite dimensional, finitely presented graded unital algebra over the field with p elements, with generators in positive degrees. We describe an effective algorithm to test…
We develop the Witt group for certain braided monoidal categories with duality. In case of a braided fusion category over an algebraically closed field of characteristic zero, we explicitly describe this structure. We then use this…
We enumerate the 15768 perfect groups of order up to $2\cdot 10^6$, up to isomorphism, thus also completing the missing cases in the prior classification. The work supplements the by now well-understood computer classifications of solvable…
In this paper we study grouplike monoids, these are monoids that contain a group to which we add an ordered set of idempotents. We classify finite categories with two objects having grouplike endomorphism monoids, and we give a count of…
It is well known that if two finite groups have the same symmetric tensor categories of representations over C, then they are isomorphic. We study the following question: when do two finite groups G1,G2 have the same tensor categories of…
The groups of order 64p without a normal sylow p-subgroup are listed, and their automorphism groups are also determined. As a by-product of our original effort to get these groups, we needed to determine the automorphism groups of those…
The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of isomorphism…
We study the realization problem of finite groups as the group of homotopy classes of self-homotopy equivalences of finite spaces. Let $G$ be a finite group. Using an infinite family of pairwise non weakly homotopic asymmetric spaces we…
We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…
We will explore the nature of when certain finite groups have an equal covering, and when finite groups do not. Not to be confused with the concept of a cover group, a covering of a group is a collection of proper subgroups whose…
We algorithmically compute integral Eilenberg-MacLane homology of all semigroups of order at most $8$ and present some particular semigroups with notable classifying spaces, refuting conjectures of Nico. Along the way, we give an…