An automorphism of a graph is called quasi-semiregular if it fixes a unique vertex of the graph and its remaining cycles have the same length. This kind of symmetry of graphs was first investigated by Kutnar, Malnič, Martínez and Marušič in 2013, as a generalization of the well-known semiregular automorphism of a graph. Symmetric graphs of valency three or four, admitting a quasi-semiregular automorphism, have been classified in recent two papers. Let $p\geq 5$ be a prime and $Γ$ a connected symmetric graph of valency $p$ admitting a quasi-semiregular automorphism. In this paper, we first prov…
The symmetric $2$-$(v,k,λ)$ designs, with $k>λ\left(λ-3 \right)/2$, admitting a flag-transitive, point-imprimitive automorphism group are completely classified: they are the known $2$-designs with parameters $(16,6,2),(45,12,3),(15,8,4)$ or $(96,20,4)$.
It was proved in [Y.-Q. Feng, C. H. Li and J.-X. Zhou, Symmetric cubic graphs with solvable automorphism groups, {\em European J. Combin.} {\bf 45} (2015), 1-11] that a cubic symmetric graph with a solvable automorphism group is either a Cayley graph or a $2$-regular graph of type $2^2$, that is, a graph with no automorphism of order $2$ interchanging two adjacent vertices. In this paper an infinite family of non-Cayley cubic $2$-regular graphs of type $2^2$ with a solvable automorphism group is constructed. The smallest graph in this family has order 6174.
In this note we report the classification of all symmetric 2-(36,15,6) designs that admit an automorphism of order 2 and their incidence matrices generate an extremal ternary self-dual code. It is shown that up to isomorphism, there exists only one such design, having a full automorphism group of order 24, and the ternary code spanned by its incidence matrix is equivalent to the Pless symmetry code.
When dealing with symmetry properties of mathematical objects, one of the fundamental questions is to determine their full automorphism group. In this paper this question is considered in the context of even/odd permutations dichotomy. More precisely: when is it that existence of automorphisms acting as even permutations on the vertex set of a graph, called {\em even automorphisms}, forces existence of automorphisms that act as odd permutations, called {\em odd automorphisms}. As a first step towards resolving the above question, a complete information on existence of odd automorphisms in cubi…
The dual stable Grothendieck polynomials $g_λ$ and their sums $\sum_{μ\subsetλ} g_μ$ (which represent $K$-homology classes of boundary ideal sheaves and structure sheaves of Schubert varieties in the Grassmannians) have the same product structure constants. In this paper we first explain that the ring automorphism $g_λ\mapsto\sum_{μ\subsetλ} g_μ$ on the ring of symmetric functions is described as the operator $F^\perp$, the adjoint of the multiplication $(F\cdot)$, by a "group-like" element $F=\sum_{i} h_i$ where $h_i$ is the complete symmetric function. Next we give a generalization: starting…
In this paper we construct two new symmetric designs with parameters 2-(176,50,14) as designs invariant under certain subgroups of the full automorphism group of the Higman design. One is self-dual and has the full automorphism group of size 11520 and other is not self-dual and has the full automorphism group of size 2520.
Kirkman triple systems (KTSs) are among the most popular combinatorial designs and their existence has been settled a long time ago. Yet, in comparison with Steiner triple systems, little is known about their automorphism groups. In particular, there is no known congruence class representing the orders of a KTS with a number of automorphisms at least close to the number of points. We fill this gap by proving that whenever $v \equiv 39$ (mod 72), or $v \equiv 4^e48 + 3$ (mod $4^e96$) and $e \geq 0$, there exists a KTS on $v$ points having at least $v-3$ automorphisms. This is only one of the co…
Let $S_n$ denote the symmetric group of degree $n$ with $n\geq 3$. Set $S=\{c_n=(1\ 2\ldots \ n),c_n^{-1},(1\ 2)\}$. Let $Γ_n=\mathrm{Cay}(S_n,S)$ be the Cayley graph on $S_n$ with respect to $S$. In this paper, we show that $Γ_n$ ($n\geq 13$) is a normal Cayley graph, and that the full automorphism group of $Γ_n$ is equal to $\mathrm{Aut}(Γ_n)=R(S_n)\rtimes \langle\mathrm{Inn}(ϕ)\rangle\cong S_n\rtimes \mathbb{Z}_2$, where $R(S_n)$ is the right regular representation of $S_n$, $ϕ=(1\ 2)(3\ n)(4\ n-1)(5\ n-2)\cdots$ $(\in S_n)$, and $\mathrm{Inn}(ϕ)$ is the inner isomorphism of $S_n$ induced b…
Heilbronn Institute for Mathematical Research(海布龙数学研究所);University of Bristol(布里斯托大学);Worcester Polytechnic Institute(伍斯特理工学院);University of Western Australia(西澳大学)
We give a new construction of the outer automorphism of the symmetric group on six points. Our construction features a complex Hadamard matrix of order six containing third roots of unity and the algebra of split quaternions over the real numbers.
Cluster automorphisms have been shown to have links to the mapping class groups of surfaces, maximal green sequences and to exchange graph automorphisms for skew-symmetric cluster algebras. In this paper we aim to generalise these results to the skew-symmetrizable case by introducing a marking on the exchange graph. Many skew-symmetrizable matrices unfold to skew-symmetric matrices and we consider how cluster automorphisms behave under this unfolding with applications to coverings of orbifolds by surfaces.
A regular cover of a connected graph is called {\em cyclic} or {\em dihedral} if its transformation group is cyclic or dihedral respectively, and {\em arc-transitive} (or {\em symmetric}) if the fibre-preserving automorphism subgroup acts arc-transitively on the regular cover. In this paper, we give a classification of arc-transitive cyclic and dihedral covers of a connected pentavalent symmetric graph of order twice a prime. All those covers are explicitly constructed as Cayley graphs on some groups, and their full automorphism groups are determined.
These lecture notes are on automorphism groups of Cayley graphs and their applications to optimal fault-tolerance of some interconnection networks. We first give an introduction to automorphisms of graphs and an introduction to Cayley graphs. We then discuss automorphism groups of Cayley graphs. We prove that the vertex-connectivity of edge-transitive graphs is maximum possible. We investigate the automorphism group and vertex-connectivity of some families of Cayley graphs that have been considered for interconnection networks; we focus on the hypercubes, folded hypercubes, Cayley graphs gener…
A connected symmetric graph of prime valency is {\em basic} if its automorphism group contains no nontrivial normal subgroup having more than two orbits. Let $p$ be a prime and $n$ a positive integer. In this paper, we investigate properties of connected pentavalent symmetric graphs of order $2p^n$, and it is shown that a connected pentavalent symmetric graph of order $2p^n$ is basic if and only if it is either a graph of order $6$, $16$, $250$, or a graph of three infinite families of Cayley graphs on generalized dihedral groups -- one family has order $2p$ with $p=5$ or $5 \mid (p-1)$, one f…
Let $\mathrm{G}$ be a subgroup of the symmetric group $\mathfrak S(U)$ of all permutations of a countable set $U$. Let $\overline{\mathrm{G}}$ be the topological closure of $\mathrm{G}$ in the function topology on $U^U$. We initiate the study of the poset $\overline{\mathrm{G}}[U]:=\{f[U]\mid f\in \overline{\mathrm{G}}\}$ of images of the functions in $\overline{\mathrm{G}}$, being ordered under inclusion. This set $\overline{\mathrm{G}}[U]$ of subsets of the set $U$ will be called the \emph{poset of copies for} the group $\mathrm{G}$. A denomination being justified by the fact that for every …
A graph is said to be symmetric if its automorphism group is transitive on its arcs. Guo et al. (Electronic J. Combin. 18, \#P233, 2011) and Pan et al. (Electronic J. Combin. 20, \#P36, 2013) determined all pentavalent symmetric graphs of order $4pq$. In this paper, we shall generalize this result by determining all connected pentavalent symmetric graphs of order four times an odd square-free integer. It is shown in this paper that, for each of such graphs $\itΓ$, either the full automorphism group ${\sf Aut}\itΓ$ is isomorphic to ${\sf PSL}(2,p)$, ${\sf PGL}(2,p)$, ${\sf PSL}(2,p){\times}\mat…
Let $d, n \in \mathbb{Z}^+$ such that $1\leq d \leq n$. A $d$-code $\mathcal{C} \subset \mathbb{F}_q^{n \times n}$ is a subset of order $n$ square matrices with the property that for all pairs of distinct elements in $\mathcal{C}$, the rank of their difference is greater than or equal to $d$. A $d$-code with as many as possible elements is called a maximum $d$-code. The integer $d$ is also called the minimum distance of the code. When $d<n$, a classical example of such an object is the so-called generalized Gabidulin code. There exist several classes of maximum $d$-codes made up respectively o…
Let $Γ$ be a graph and let $G$ be a group of automorphisms of $Γ$. The graph $Γ$ is called $G$-normal if $G$ is normal in the automorphism group of $Γ$. Let $T$ be a finite non-abelian simple group and let $G = T^l$ with $l\geq 1$. In this paper we prove that if every connected pentavalent symmetric $T$-vertex-transitive graph is $T$-normal, then every connected pentavalent symmetric $G$-vertex-transitive graph is $G$-normal. This result, among others, implies that every connected pentavalent symmetric $G$-vertex-transitive graph is $G$-normal except $T$ is one of $57$ simple groups. Furthermo…
We construct Hopf algebras whose elements are representations of combinatorial automorphism groups, by generalising a theorem of Zelevinsky on Hopf algebras of representations of wreath products. As an application we attach symmetric functions to representations of graph automorphism groups, generalising and refining Stanley's chromatic symmetric function.
Let $X$ be a connected, locally finite graph with symmetric growth. We prove that there is a vertex coloring $ϕ\colon X\to\{0,1\}$ and some $R\in\mathbb{N}$ such that every automorphism $f$ preserving $ϕ$ is $R$-close to the identity map; this can be seen as a coarse geometric version of symmetry breaking. We also prove that the infinite motion conjecture is true for graphs where at least one vertex stabilizer $S_x$ satisfies the following condition: for every non-identity automorphism $f\in S_x$, there is a sequence $x_n$ such that $\lim d(x_n,f(x_n))=\infty$.