Related papers: The automorphism groups of some token graphs

For a digraph $D$ of order $n$ and an integer $1 \leq k \leq n-1$, the $k$-token digraph of $D$ is the graph whose vertices are all $k$-subsets of vertices of $D$ and, given two such $k$-subsets $A$ and $B$, $(A,B)$ is an arc in the…

A multi-GGS-group is a group of automorphisms of a regular rooted tree, generalising the Gupta--Sidki $p$-groups. We compute the automorphism groups of all non-constant multi-GGS-groups.

We introduce a quantum automorphism group for hypergraphs, which turns out to generalize the quantum automorphism group of Bichon for classical graphs. Further, we show that our quantum automorphism group acts on hypergraph C*-algebras as…

The $k$-token graph of $G$ is the graph, $F_k(G)$, whose vertices are all the $k$-subsets of $V(G)$; with two of them adjacent whenever their symmetric difference is a pair of adjacent vertices in $G$. In this paper, we study the domination…

Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a…

This study investigates the properties of the 3-token graph derived from path graphs, with a particular focus on its structural characteristics and key attributes. We analyze how the 3-token graph is constructed from path graphs and explore…

In this paper we classify curves of genus 2 with group of automorphisms isomorphic to D_8 or D_12 over an arbitrary field k (of characteristic different from 2 in the D_8 case and from 2 and 3 in the D_{12} case) up to k-isomorphism. As an…

We determine all factorisations $X=AB$, where $X$ is a finite almost simple group and $A,B$ are core-free subgroups such that $A\cap B$ is cyclic or dihedral. As a main application, we classify the graphs $\Gamma$ admitting an almost simple…

Motivated by the vast literature of quantum automorphism groups of graphs, we define and study quantum automorphism groups of matroids. A key feature of quantum groups is that there are many quantizations of a classical group, and this…

Let $R$ be a commutative ring with identity. We define a graph $\Gamma_{\aut}(R)$ on $ R$, with vertices elements of $R$, such that any two distinct vertices $x, y$ are adjacent if and only if there exists $\sigma \in \aut$ such that…

The groups of automorphisms of the Lie algebras of unitriangular polynomial derivations are found.

Up to switching isomorphism there are six ways to put signs on the edges of the Petersen graph. We prove this by computing switching invariants, especially frustration indices and frustration numbers, switching automorphism groups,…

We study the automorphism group of the algebra $\oqmn$ of $n \times n$ generic quantum matrices. We provide evidence for our conjecture that this group is generated by the transposition and the subgroup of those automorphisms acting on the…

The {\em topological symmetry group} of an embedding $\Gamma$ of an abstract graph $\gamma$ in $S^3$ is the group of automorphisms of $\gamma$ which can be realized by homeomorphisms of the pair $(S^3, \Gamma)$. These groups are motivated…

The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…

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.

In 2019, Aterias et al. constructed pairs of quantum isomorphic, non-isomorphic graphs from linear constraint systems. This article deals with quantum automorphisms and quantum isomorphisms of colored versions of those graphs. We show that…

Recently, the first author classified finite groups obtained as automorphism groups of smooth plane curves of degree $d \ge 4$ into five types. He gave an upper bound of the order of the automorphism group for each types. For one of them,…

Two mappings in a finite field, the Frobenius mapping and the cyclic shift mapping, are applied on lines in PG($n,p$) or codes in the Grassmannian, to form automorphisms groups in the Grassmanian and in its codes. These automorphisms are…

The description of the automorphism group of group $<a, b; [a^m,b^n]=1>$ ($m,n>1$) in terms of generators and defining relations is given. This result is applied to prove that any normal automorphism of every such group is inner.