In this paper, we consider the projective special linear group $PSL_2(59)$ and construct some 1-designs by applying the Key-Moori method on $PSL_2(59)$. Moreover, we obtain parameters of these designs and their automorphism groups. It is shown that $PSL_2(59)$ and $PSL_2(59):2$ appear as the automorphism group of the constructed designs.

Let $G$ be a finite group. The automorphism $sigma$ of a group $G$ is said to be an absolute central automorphism, if for all $xin G$, $x^{-1}x^{sigma}in L(G)$, where $L(G)$ be the absolute centre of $G$. In this paper, we study  some properties of absolute central automorphisms of a given finite $p$-group.

let $gamma$ be a normal subgroup of the full automorphism group $aut(g)$ of a group $g$‎, ‎and assume that $inn(g)leq gamma$‎. ‎an endomorphism $sigma$ of $g$ is said to be {it $gamma$-central} if $sigma$ induces the the identity on the factor group $g/c_g(gamma)$‎. ‎clearly‎, ‎if $gamma=inn(g)$‎, ‎then a $gamma$-central endomorphism is a {it central} endomorphism‎. ‎in this article the conditi...

suppose $gamma$ is a graph with $v(gamma) = { 1,2, cdots, p}$and $ mathcal{f} = {gamma_1,cdots, gamma_p} $ is a family ofgraphs such that $n_j = |v(gamma_j)|$, $1 leq j leq p$. define$lambda = gamma[gamma_1,cdots, gamma_p]$ to be a graph withvertex set $ v(lambda)=bigcup_{j=1}^pv(gamma_j)$ and edge set$e(lambda)=big(bigcup_{j=1}^pe(gamma_j)big)cupbig(bigcup_{ijine(gamma)}{uv;uin v(gamma_i),vin ...

A shift automorphism algebra is one satisfying the conditions of the shift automorphism theorem, and a shift automorphism variety is a variety generated by a shift automorphism algebra. In this paper, we show that every shift automorphism variety contains a countably infinite subdirectly irreducible algebra. 2000 Mathematics subject classification: primary 03C05; secondary 08B05, 08B26.

we prove that each normal automorphism of the $n$-periodic product of cyclic groups of odd order $rge1003$ is inner, whenever $r$ divides $n$.

On the Automorphism Tower of Free Nilpotent Groups Martin Dimitrov Kassabov 2003 In this thesis I study the automorphism tower of free nilpo-tent groups. Our main tool in studying the automorphism tower is to embed every group as a lattice in some Lie group. Using known rigidity results the automorphism group of the discrete group can be embedded into the automorphism group of the Lie group. Th...

The concept of graph symmetry is explained in terms of the vertex automorphism group, which is a subgroup of the complete vertex permutation group. The automorphism group can be deduced from the automorphism partition of graph vertices. An algorithm is described which constructs the automorphism group of a graph from the automorphism vertex partitioning. The algorithm is useful especially for g...

Automorphism groupS of Hadamard matrices are related to automorphism groups of de.Jigns, and the automorphism groups of the Paley-Hadamard matrices are determined .