Related papers: A classification of metacyclic groups by group inv…
We prove that if $G$ is a finite simple group which is the unit group of a ring, then $G$ is isomorphic to either (a) a cyclic group of order 2; (b) a cyclic group of prime order $2^k -1$ for some $k$; or (c) a projective special linear…
Let $G$ be a group. \textit{The permutability graph of cyclic subgroups of $G$}, denoted by $\Gamma_c(G)$, is a graph with all the proper cyclic subgroups of $G$ as its vertices and two distinct vertices in $\Gamma_c(G)$ are adjacent if and…
In this paper we describe graded automorphisms and antiautomorphisms of finite order on matrix algebras endowed with a group gradings by a finite abelian group over an arbitrary algebraically closed field of charcteristic different from 2.
The isomorphism problem means to decide if two given finite-dimensional simple algebras over the same centre are isomorphic and, if so, to construct an isomorphism between them. A solution to this problem has applications in computational…
We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability…
Using the theory of group action, we first introduce the concept of the automorphism group of an exponential family or a graphical model, thus formalizing the general notion of symmetry of a probabilistic model. This automorphism group…
T\u{a}rn\u{a}uceanu described the finite groups $G$ having exactly $|G|-1$ cyclic subgroups. In "Finite Groups with a Prescribed Number of Cyclic Subgroups,", we used elementary methods to completely characterize those finite groups $G$…
Counting homomorphisms between cyclic groups is a common exercise in a first course in abstract algebra. A similar problem, accessible at the same level, is to count the number of group homomorphisms from a dihedral group of order $2m$ into…
A group $G$ is called logically cyclic, if it contains an element $s$ such that every element of $G$ can be defined by a first order formula with parameter $s$. The aim of this paper is to investigate the structure of such groups.
We define graded group schemes and graded group varieties and develop their theory. Graded group schemes are the graded analogue of group schemes and are in correspondence with graded Hopf algebra. In this setting, graded group varieties…
We introduce the isoclinism of crossed modules. We also give GAP implementations for constructing the isoclinism families of finite crossed modules and consequently give an enumeration about isoclinic crossed modules existing in the GAP…
The asymptotic study of the conjugacy classes of a random element of the finite affine group leads one to define a probability measure on the set of all partitions of all positive integers. Four different probabilistic understandings of…
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 commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given…
We give a simple algorithm that enables us to determine whether a subgroup of finite index of the Hecke group is normal.
The exact degree bound for the generators of rings of polynomial invariants is determined for the finite, non-cyclic groups having a cyclic subgroup of index two. It is proved that the Noether number of these groups equals one half the…
This article investigates the properties of order-divisor graphs associated with finite groups. An order-divisor graph of a finite group is an undirected graph in which the set of vertices includes all elements of the group, and two…
We describe the autotopism group Atp(G) of any abelian group G as being a semidirect product of its automorphism group Aut(G) and G^2. We then provide the subgroup structure of Atp(G) when G is a finite cyclic group.
This article initiates a geometric study of the automorphism groups of general graph products of groups, and investigates the algebraic and geometric structure of automorphism groups of cyclic product of groups. For a cyclic product of at…
We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part we discus the main structures…