Related papers: Automorphism Groups of the $PSL_2(q)$ Commuting In…

We investigate the relationship between finite groups and incidence geometries through their automorphism structures. Building upon classical results on the realizability of groups as automorphism groups of graphs, we develop a general…

A geometric graph is a simple graph G together with a straight line drawing of G in the plane with the vertices in general position. Two geometric realizations of a simple graph are geo-isomorphic if there is a vertex bijection between them…

We present a strong connection between quantum information and quantum permutation groups. Specifically, we define a notion of quantum isomorphisms of graphs based on quantum automorphisms from the theory of quantum groups, and then show…

Let $Z(\cal L)$ be the center of a Lie algebra $\cal L$ with Lie bracket $[\cdot, \cdot]$. %We then define The commuting graph of $\cal L$ is then defined by the simple undirected graph $\Gamma({\cal L})=(V_{\cal L},E_{\cal L})$ in which…

For a finite group G of Lie type and a prime p, we compare the automorphism groups of the fusion and linking systems of G at p with the automorphism group of G itself. When p is the defining characteristic of G, they are all isomorphic,…

In this paper we introduce the symmetric normaliser graph of a group $G$. The vertex set of this graph consists of elements of the group. Vertices $x$ and $y$ are adjacent if $x$ lies in the normaliser of $\langle y \rangle$ and $y$ lies in…

Let $G=QD_{8k}~$ be the quasi-dihedral group of order $8n$ and $\theta$ be an automorphism of $QD_{8k}$ of finite order. The fixed-point set $H$ of $\theta$ is defined as $H_{\theta}=G^{\theta}=\{x\in G \mid \theta(x)=x\}$ and generalized…

For a subshift over a finite alphabet, a measure of the complexity of the system is obtained by counting the number of nonempty cylinder sets of length $n$. When this complexity grows exponentially, the automorphism group has been shown to…

Let $G$ be a finite group and $N(G)$ be the set of its conjugacy class sizes excluding~$1$. Let us define a directed graph $\Gamma(G)$, the set of vertices of this graph is $N(G)$ and the vertices $x$ and $y$ are connected by a directed…

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…

Let G be a complex semisimple linear algebraic group, and X a wonderful G-variety. We determine the connected automorphism group of X and we calculate Luna's invariants of X under its action.

In this paper, we discuss automorphism related parameters of a graph associated to a finite vector space. The fixing neighborhood of a pair $(u,v)$ of vertices of a graph $G$ is the set of all those vertices $w$ of $G$, such that the orbits…

In this paper we consider the class of 2-dimensional Artin groups with connected, large type, triangle-free defining graphs (type CLTTF). We classify these groups up to isomorphism, and describe a generating set for the automorphism group…

Let $\Gamma$ be a connected $G$-vertex-transitive graph, let $v$ be a vertex of $\Gamma$ and let $L=G_v^{\Gamma(v)}$ be the permutation group induced by the action of the vertex-stabiliser $G_v$ on the neighbourhood $\Gamma(v)$. Then…

In this paper, we prove that if G is a finite simple group with the same-size conjugacy class set U(G) = U(PSL(2, 11)), then G is isomorphic to PSL(2, 11).

We define a notion of quantum automorphism group of Graph C*-algebras for finite, connected graphs. Under the assumption that the underlying graph does not have any multiple edge or loop, the quantum automorphism group of underlying…

A graph \Gamma is said to be {\em symmetric} if its automorphism group \Aut(\Gamma) is transitive on the arc set of \Gamma. Let $G$ be a finite non-abelian simple group and let \Gamma be a connected pentavalent symmetric graph such that…

A graph $\G$ is {\em symmetric} or {\em arc-transitive} if its automorphism group $\Aut(\G)$ is transitive on the arc set of the graph, and $\G$ is {\em basic} if $\Aut(\G)$ has no non-trivial normal subgroup $N$ such that the quotient…

Let $\mathcal{X}$ be an irreducible algebraic curve defined over a finite field $\mathbb{F}_q$ of characteristic $p>2$. Assume that the $\mathbb{F}_q$-automorphism group of $\mathcal{X}$ admits as an automorphism group the direct product of…

We consider the following problem closely related to graph isomorphism. In a simplified version, the task is to compute the automorphism group of a given set family (or a hypergraph), that is, the group of all automorphisms of the given…