相关论文: The Automorphism Groups of the Groups of Order 8p^…

Results of the computation of the automorphism groups for the groups of orders $16p$ and $16p^{2}$ are given. In some cases it has not been possible to give as complete a set of results as was done previously for the case of groups of order…

The results of computer computations determining the automorphism groups of the groups of order 32$p$ for $p \geq 3$ are given in several tables. Presentations for the automorphism groups of the groups of order 32, which in many cases…

In this paper, we have computed the automorphism groups of all groups of order $p^{2}q^{2}$, where $p$ and $q$ are distinct primes.

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 groups of order 64p without a normal sylow p-subgroup are listed, and their automorphism groups are also determined. As a by-product of our original effort to get these groups, we needed to determine the automorphism groups of those…

For every prime $p>3$ we prove that $Q \times \mathbb{Z}_p$ and $\mathbb{Z}_2^3 \times \mathbb{Z}_p$ are DCI- groups. This result completes the description of CI-groups of order $8p$.

Let $T_{8p} = \left\langle a,b\mid a^{2p}=b^8=e,a^p=b^4,b^{-1}ab=a^{-1} \right\rangle$ be a nonabelian group of order $8p$, where $p$ is an odd prime number. In this paper, we give the formula to calculate the number of Cayley graphs over…

These lecture notes provide an introduction to automorphism groups of graphs. Some special families of graphs are then discussed, especially the families of Cayley graphs generated by transposition sets.

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…

Given positive integers $p$ and $m$, where $p$ is assumed to be an odd prime, we determine the automorphism groups of $p$-groups $J$, $H$, and $K$ of orders $p^{7m}$, $p^{6m}$, and $p^{5m}$, and nilpotency classes 5, 4, and 3, respectively,…

This survey on the automorphism groups of finite p-groups focuses on three major topics: explicit computations for familiar finite p-groups, such as the extraspecial p-groups and Sylow p-subgroups of Chevalley groups; constructing p-groups…

We derive a formula connecting the orders of the automorphism groups of a finite group and of its covering groups.

We give a computer-assisted proof that if $G$ is a finite group of order $8pq$, where $p$ and $q$ are distinct primes, then every connected Cayley graph on $G$ has a hamiltonian cycle.

We give a complete list of all the 70 class two groups of exponent p (p>2) and order p^k for k<9. For each of these groups the number of conjugacy classes is a polynomial in p, and the order of the automorphism group is a polynomial in p.…

The author determines the structure of automorphism groups of smooth plane curves of degree at least four. Furthermore, he gives some upper bounds for the order of automorphism groups of smooth plane curves and classifies the cases with…

In this paper, we study plane quintic curves whose automorphism groups have order greater than 10, as well as those with cyclic automorphism groups of order 8 and 10. The latter two cases are represented as one-parameter families, where…

The groups whose orders factorise into at most four primes have been described (up to isomorphism) in various papers. Given such an order n, this paper exhibits a new explicit and compact determination of the isomorphism types of the groups…

We consider the Macdonald group $\langle x,y\,|\, x^{[x,y]}=x^{1+2^m\ell},\, y^{[y,x]}=y^{1+2^m\ell}\rangle$ and its Sylow 2-subgroup $J=\langle x,y\,|\, x^{[x,y]}=x^{1+2^m\ell},\, y^{[y,x]}=y^{1+2^m\ell},…

In this paper, we propose an algorithm to enumerate genus-4 superspecial hyperelliptic curves whose automorphism groups isomorphic to the quaternion group. By implementing this algorithm with Magma, we successfully obtain the number of…

We construct a polynomial-time algorithm that given a graph $X$ with $4p$ vertices ($p$ is prime), finds (if any) a Cayley representation of $X$ over the group $C_2\times C_2\times C_p$. This result, together with the known similar result…