Related papers: Path partial groups

There are a variety of ways to associate directed or undirected graphs to a group. It may be interesting to investigate the relations between the structure of these graphs and characterizing certain properties of the group in terms of some…

An automorphism $\alpha$ of a group $G$ is normal if it fixes every normal subgroup of $G$ setwise. We give an algebraic description of normal automorphisms of relatively hyperbolic groups. In particular, we prove that for any relatively…

In universal algebraic geometry the category of the finite generated free algebras of some fixed variety of algebras and the quotient group A/Y are very important. Here A is a group of all automorphisms of this category and Y is a group of…

We determine the quantum automorphism groups of finite graphs. These are quantum subgroups of the quantum permutation groups defined by Wang. The quantum automorphism group is a stronger invariant for finite graphs than the usual one. We…

Let $G$ be a finite group. For each $m>1$ we define the symmetric canonical subset $S=S(m)$ of the Cartesian power $G^m$ and we consider the family of Cayley graphs $\mathscr{G}_m(G)=Cay(G^m,S)$. We describe properties of these graphs and…

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.

For a finite group $G$, we define the inclusion graph of subgroups of $G$, denoted by $\mathcal I(G)$, is a graph having all the proper subgroups of $G$ as its vertices and two distinct vertices $H$ and $K$ in $\mathcal I(G)$ are adjacent…

Let $G$ be a finite non-cyclic $p$-group of order at least $p^3$. If $G$ has an abelian maximal subgroup, or if $G$ has an elementary abelian centre with $C_G(Z(\Phi(G))) \ne \Phi(G)$, then $|G|$ divides $|\text{Aut}(G)|$.

Let $G$ be a finite $p$-group.

It is proved in [J. Group Theory, {\bf 10} (2007), 859-866] that if $G$ is a finite $p$-group such that $(G,Z(G))$ is a Camina pair, then $|G|$ divides $|\Aut(G)|$. We give a very short and elementary proof of this result.

We show that the outer automorphism group of a polycyclic-by-finite group is an arithmetic group. This result follows from a detailed structural analysis of the automorphism groups of such groups. We use an extended version of the theory of…

We classify all finite $p$-groups $G$ for which |$Aut_{c}(G)$| attains its maximum value, where $Aut_{c}(G)$ denotes the group of all class preserving automorphisms of $G$ .

We initiate a systematic study of cohomology theories for partial groups, algebraic structures introduced by Chermak that generalize groups by allowing only partially defined products. Inspired by classical group cohomology, we develop two…

The partial automorphisms of a graph $X$ having $N$ vertices are the bijections $\sigma:I\to J$ with $I,J\subset\{1,\ldots,N\}$ which leave invariant the edges. These bijections form a semigroup $\widetilde{G}(X)$, which contains the…

Let $K$ be a field, and let $\Aut \,K^2$ be the group of polynomial automorphisms of $K^2$. We investigate which subgroups are linear or not. In characteristic zero, there are small nonlinear subgroups and some big linear subgroups. When…

We show that the automorphism groups of right-angled Artin groups whose defining graphs have at least 3 vertices are not relatively hyperbolic. We then show that the outer automorphism groups are not relatively hyperbolic, if they are not…

A regular bipartite graph $\Gamma$ is called semisymmetric if its full automorphism group $\mathrm{Aut}(\Gamma)$ acts transitively on the edge set but not on the vertex set. For a subgroup $G$ of $\mathrm{Aut}(\Gamma)$ that stabilizes the…

The present work investigates regular, semiregular, and chiral polytopes of any rank $d\geq 3$, whose automorphism groups are 2-groups. There is a large variety of rather small finite regular or alternating semiregular polytopes with…

Let $H$ be an additively written monoid and let $\mathcal{P}_{0}(H)$ denote the reduced power monoid of $H$, that is, the monoid consisting of all subsets of $H$ containing $0$ with set addition as operation. Following work of Tringali, Wen…

In this paper we study the realizability question for commuting graphs of finite groups: Given an undirected graph $X$ is it the commuting graph of a group $G$? And if so, to determine such a group. We seek efficient algorithms for this…