Related papers: Aut($\Gamma$)=det($M_\Gamma$)

Two vertices $u$ and $v$ of a graph $\Gamma$ are strucuturally equivalent if and only if the transposition $(u\,v)$ is in Aut($\Gamma$), the automorphism group of $\Gamma$. Some properties of structural equivalence and the group of vertex…

Let $H$ be a complex Hilbert space. Consider the ortho-Grassmann graph $\Gamma^{\perp}_{k}(H)$ whose vertices are $k$-dimensional subspaces of $H$ (projections of rank $k$) and two subspaces are connected by an edge in this graph if they…

This article is dedicated to the study of the acylindrical hyperbolicity of automorphism groups of graph products of groups. Our main result is that, if $\Gamma$ is a finite graph which contains at least two vertices and is not a join and…

We show that if a field k contains sufficiently many elements(for instance, if k is infinite), and K is an algebraically closed field containing k, then every linear algebraic k-group over K is k-isomorphic to Aut(A\otimes_kK), where A is a…

Let $G$ and $H$ be two simple graphs. A bijection $\phi:V(G)\rightarrow V(H)$ is called an isomorphism between $G$ and $H$ if $(\phi v_i)(\phi v_j)\in E(H)$ $\Leftrightarrow$ $v_i v_j\in E(G)$, $\forall v_i,v_j \in V(G)$. In the case that…

Let $G$ be a finite group and $M,N$ be two normal subgroups of $G$. Let $Aut_N^M(G)$ denote the group of all automorphisms of $G$ which fix $N$ element wise and act trivially on $G/M$. Let $n$ be a positive integer. In this article we have…

We show that the isomorphism problem is solvable in the class of central extensions of word-hyperbolic groups, and that the isomorphism problem for biautomatic groups reduces to that for biautomatic groups with finite centre. We describe an…

Let $K$ be a field of characteristic different from 2 and let $G$ be a group. If the algebra $UT_n$ of $n\times n$ upper triangular matrices over $K$ is endowed with a $G$-grading $\Gamma: UT_n=\oplus_{g\in G}A_g$ we give necessary and…

We prove that every 2-local automorphism of the unitary group or the general linear group on a complex infinite-dimensional separable Hilbert space is an automorphism. Thus these types of transformations are completely determined by their…

We give elementary proofs of the following two theorems on automorphisms of a finite group G: (1) An automorphism of G is inner if and only if it extends to an automorphism of every finite group containing G. (2) There exists a finite…

Let $\Gamma$ be a simple undirected graph on a finite vertex set and let $A$ be its adjacency matrix. Then $\Gamma$ is {\it singular} if $A$ is singular. The problem of characterising singular graphs is easy to state but very difficult to…

We consider a class of graphs subject to certain restrictions, including the finiteness of diameters. Any surjective mapping $\phi:\Gamma\to\Gamma'$ between graphs from this class is shown to be an isomorphism provided that the following…

We study fixed subgroups of automorphisms of any large-type Artin group $A_{\Gamma}$. We define a natural subgroup $\mathrm{Aut}_\Gamma(A_\Gamma)$ of $\mathrm{Aut}(A_{\Gamma})$, and for every $\gamma \in \mathrm{Aut}_\Gamma(A_\Gamma)$ we…

The Johnson graph $J(n, i)$ is defined as the graph whose vertex set is the set of all $i$-element subsets of $\{1, . . ., n \}$, and two vertices are adjacent whenever the cardinality of their intersection is equal to $i$-1. In Ramras and…

Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…

Let $G$ be a group. The central automorphism group $Aut_c(G)$ of $G$ is the centralizer of $Inn(G)$ the subgroup of $Aut(G)$ of inner automorphisms. There is a one to one map $ \sigma \mapsto h_\sigma$ from the set $Aut_c(G)$ onto the set…

We determine the automorphism group of the zero-divisor digraph of the semiring of matrices over an antinegative commutative semiring with a finite number of zero-divisors.

Let $S$ be a non-empty finite set. A flag of $S$ is a set $f$ of non-empty proper subsets of $S$ such that $X\subseteq Y$ or $Y\subseteq X$ for all $X,Y\in f$. The set $\{|X|:X\in f\}$ is called the type of $f$. Two flags $f$ and $f'$ are…

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

Consider a smooth connected algebraic group $G$ acting on a normal projective variety $X$ with an open dense orbit. We show that Aut($X$) is a linear algebraic group if so is $G$; for an arbitrary $G$, the group of components of Aut($X$) is…