Related papers: On the isomorphism problem for unit groups of modu…

The strong symmetric genus of a finite group is the minimum genus of a compact Riemann surface on which the group acts as a group of automorphisms preserving orientation. A characterization of the infinite number of groups with strong…

Let p be an odd prime, F the field of p elements and G a finite abelian p-group with an arbitrary involutory automorphism. Extend this automorphism to the group algebra FG and consider the unitary and the symmetric normalized units of FG.…

We extend the loop algebra construction for algebras graded by abelian groups to study graded-simple algebras over the field of real numbers (or any real closed field). As an application, we classify up to isomorphism the graded-simple…

We give a general criterion for the (bounded) simplicity of the automorphism groups of certain countable structures and apply it to show that the isometry group of the Urysohn space modulo the normal subgroup of bounded isometries is a…

An isomorphism between two hermitian unitals is proved, and used to treat isomorphisms of classical groups that are related to the isomorphism between certain simple real Lie algebras of types A and D (and rank 3).

The normaliser problem takes as input subgroups $G$ and $H$ of the symmetric group $S_n$, and asks one to compute $N_G(H)$. The fastest known algorithm for this problem is simply exponential, whilst more efficient algorithms are known for…

The mod 2 cohomology algebra of the holomorph of any finite cyclic group whose order is a power of 2 is determined.

Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. We bridge this gap for a natural and important special case, planar graph isomorphism,…

Let $G$ be a locally compact group and $\omega$ be a continuous weight on $G$. In this paper, we first characterize bicontinuous biseparating algebra isomorphisms between weighted $L^p$-algebras. As a result we extend previous results of…

We describe the graded isomorphisms of rings of endomorphisms of graded flags over graded division algebras. As a consequence describe the isomorphism classes of upper block triangular matrix algebras (over an algebraically closed field of…

We describe two algorithms for finding representatives of the nilpotent orbits of a theta-group. The algorithms have been implemented in the computer algebra system GAP (inside the package SLA). We comment on their performance. We apply the…

Classifying isomorphism classes of group gradings on algebras presents a compelling challenge, particularly within the realms of non-simple and infinite-dimensional algebras, which have been relatively unexplored. This study focuses on a…

We develop practical techniques to compute with arithmetic groups $H\leq \mathrm{SL}(n,\mathbb{Q})$ for $n>2$. Our approach relies on constructing a principal congruence subgroup in $H$. Problems solved include testing membership in $H$,…

Landau's theorem on conjugacy classes asserts that there are only finitely many finite groups, up to isomorphism, with exactly $k$ conjugacy classes for any positive integer $k$. We show that, for any positive integers $n$ and $s$, there…

We classify, up to isomorphism, all gradings by an arbitrary abelian group on simple finitary Lie algebras of linear transformations (special linear, orthogonal and symplectic) on infinite-dimensional vector spaces over an algebraically…

We prove that the double covers of the alternating and symmetric groups are determined by their complex group algebras. To be more precise, let $n\geq 5$ be an integer, $G$ a finite group, and let $\AAA$ and $\SSS^\pm$ denote the double…

For a given abelian group G, we classify the isomorphism classes of G-gradings on the simple restricted Lie algebras of types W(m;1) and S(m;1) (m>=2), in terms of numerical and group-theoretical invariants. Our main tool is automorphism…

Given two tuples of subspaces, can you tell whether the tuples are isomorphic? We develop theory and algorithms to address this fundamental question. We focus on isomorphisms in which the ambient vector space is acted on by either a unitary…

We present a new algorithm that, given two matrices in $GL(n,Q)$, decides if they are conjugate in $GL(n,Z)$ and, if so, determines a conjugating matrix. We also give an algorithm to construct a generating set for the centraliser in…

Given a finite group $G$, the generating graph $\Gamma(G)$ of $G$ has as vertices the non-identity elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. Let $G$ be a 2-generated…