Related papers: Groups whose orders factorise into at most four pr…
We characterize all finite p-groups G of order p^n(n\leq 6), where p is a prime for n\leq 5 and an odd prime for n = 6, such that the center of the inner automorphism group of G is equal to the group of central automorphisms of G.
We investigate which invariants of groups are powerful in distinguishing non-isomorphic p-groups. We introduce the notations of siblings and twins for p-groups that are difficult to distinguish and we describe the siblings and twins among…
The finite groups having an indecomposable polynomial invariant whose degree is at least half of the order of the group are classified. Apart from four sporadic exceptions these are exactly the groups having a cyclic subgroup of index at…
The isomorphism problem for finite groups of order n (GpI) has long been known to be solvable in $n^{\log n+O(1)}$ time, but only recently were polynomial-time algorithms designed for several interesting group classes. Inspired by recent…
The average order of a finite group G is denoted by o(G). In this note, we classify groups whose average orders are less than o(S4), where S4 is the symmetric group on four elements. Moreover, we prove that G \cong S4 if and only if o(G) =…
In earlier work, the first author outlined an algorithm for calculating a parametrization of the conjugacy classes in a Sylow $p$-subgroup $U(q)$ of a finite Chevalley group $G(q)$, valid when $q$ is a power of a good prime for $G(q)$. In…
We record for reference a detailed description of the automorphism groups of the groups of order $p^{2} q$, where $p$ and $q$ are distinct primes.
The automorphism groups for the groups of orders $8p$ and $8p^2$ are given. The calculations were done using the programming language CAYLEY. Explicit presentations for both the groups of these orders and their automorphism groups are…
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…
We prove that the automorphism group of the dihedral quandle with n elements is isomorphic to the affine group of the integers mod n, and also obtain the inner automorphism group of this quandle. In [9], automorphism groups of quandles (up…
A method for finding an optimum $n$-dimensional commutative group code of a given order $M$ is presented. The approach explores the structure of lattices related to these codes and provides a significant reduction in the number of…
A group $G$ is said to be $k$-generated if it has a generating set with $k$ elements. A positive integer $n$ is called a \emph{2-generated number} if every group of order $n$ is 2-generated. In this article, we establish an arithmetic…
In this paper, we present a novel approach for calculating the set of subgroups of a finite group, focusing on cyclic subgroups, and using it to establish the quantity of all subgroups in the direct product of two groups. Specifically, we…
Let $FG$ be the group algebra of a finite $p$-group $G$ over a finite field $F$ of positive characteristic $p$. Let $\cd$ be an involution of the algebra $FG$ which is a linear extension of an anti-automorphism of the group $G$ to $FG$. If…
A $P_4$-free graph is called a cograph. In this paper we partially characterize finite groups whose power graph is a cograph. As we will see, this problem is a generalization of the determination of groups in which every element has prime…
We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…
A rack on $[n]$ can be thought of as a set of maps $(f_x)_{x \in [n]}$, where each $f_x$ is a permutation of $[n]$ such that $f_{(x)f_y} = f_y^{-1}f_xf_y$ for all $x$ and $y$. In 2013, Blackburn showed that the number of isomorphism classes…
Polytopes are ubiquitous in different areas of mathematics. Gleason and Hubard established a factorisation theorem, stating that every abstract polytope has a unique factorisation into prime polytopes. We compute the automorphism group of a…
The groups distinguish their von Neumann algebras, in the case when these are factors.
A connected component of an affine algebraic group is called periodic if all its elements have finite order. We give a characterization of periodic components in terms of automorphisms with finite number of fixed points. It is also…