Related papers: Efficient Isomorphism Testing for a Class of Group…

The automorphism group of a code is the group of permutations that map a code to itself. Berman codes are a class of binary linear codes characterized by two integer parameters $n\geq 2$ and $m\geq 1$, and this class includes the…

The computation of the normaliser of a permutation group in the full symmetric group is an important and hard problem in computational group theory. This article reports on an algorithm that builds a descending chain of overgroups to…

We say that finite groups are isospectral if they have the same sets of orders of elements. It is known that every nonsolvable finite group $G$ isospectral to a finite simple group has a unique nonabelian composition factor, that is, the…

We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks to decide, given two tuples of (skew-)symmetric matrices $(B_1, \dots, B_m)$ and $(C_1, \dots, C_m)$, whether there exists an…

Strong external difference families (SEDFs) have applications to cryptography and are rich combinatorial structures in their own right; until now, all SEDFs have been in abelian groups. In this paper, we consider SEDFs in both abelian and…

We study the set of homomorphisms from a fixed finitely generated group into a family of groups which are `uniformly acylindrically hyperbolic'. Our main results reduce this study to sets of homomorphisms which do not diverge in an…

We give an explicit description of the category of central extensions of a group scheme by a sheaf of Abelian groups. Based on this, we describe a framework for computing with central extensions of finite commutative group schemes, torsors…

We make explicit some conditions on a semi-abelian category D such that, for any abelian group A in D and any object Y in D, the cohomology group homomorphisms with coefficients in A, induced by the inclusion of the abelian objects of D at…

Let $F$ be a free group of finite rank. We say that the monomorphism problem in $F$ is decidable if for any two elements $u$ and $v$ in $F$, there is an algorithm that determines whether there exists a monomorphism of $F$ that sends $u$ to…

This paper analyzes the second cohomology group of a linear cycle set with coefficients in an abelian group I, for linear cycle sets with commutative adjoint operation, focusing on the finite abelian case. It aims to classify extensions of…

We construct an embedding G of the category of graphs into the category of abelian groups such that for graphs X and Y we have Hom(GX,GY)=Z[Hom(X,Y)], the free abelian group whose basis is the set Hom(X,Y). The isomorphism is functorial in…

A number of authors have studied the question of when a graph can be represented as a Cayley graph on more than one nonisomorphic group. The work to date has focussed on a few special situations: when the groups are $p$-groups; when the…

Weanalyzethecomputationalcomplexityofanalgorithmtosolve the conjugacy search problem in a certain family of metabelian groups. We prove that in general the time complexity of the conjugacy search problem for these groups is at most…

Let $G$ be a finite group given as input by its multiplication table. For a subset $S$ of $G$ and an element $g\in G$ the Cayley Group Membership Problem (denoted CGM) is to check if $g$ belongs to the subgroup generated by $S$. While this…

First we prove that any inner automorphism in the stabilizer of a graded-simple unital associative algebra whose grading group is abelian is the conjugation by a homogeneous element. Now consider a grading by an abelian group on an…

The construction of torsion-free abelian groups with prescribed endomorphism rings starting with Corner's seminal work is a well-studied subject in the theory of abelian groups. Usually these construction work by adding elements from a…

The theory of abelian categories proved very useful, providing an axiomatic framework for homology and cohomology of modules over a ring and, in particular, of abelian groups. For many years, a similar categorical framework has been lacking…

We study the Modular Isomorphism Problem (MIP) for groups of small order based on an improvement of an algorithm described by B. Eick. Our improvement allows to determine quotients $I(kG)/I(kG)^m$ of the augmentation ideal without first…

We prove that the isomorphism problem for group algebras reduces to group algebras over finite extensions of the prime field. In particular, the modular isomorphism problem reduces to finite modular group algebras.

We consider a zero-error probabilistic group testing problem where individuals are defective independently but not with identical probabilities. We propose a greedy set formation method to build sets of individuals to be tested together. We…