Related papers: Block-transitive $3$-$(v,k,1)$ designs associated …
In this article we study the transitivity of the group of automorphisms of real algebraic surfaces. We characterize real algebraic surfaces with very transitive automorphism groups. We give applications to the classification of real…
In this paper we analyze possible actions of an automorphism of order six on a $2$-$(70, 24, 8)$ design, and give a complete classification for the action of the cyclic automorphism group of order six $G= \langle \rho \rangle \cong Z_6…
A graph Gamma is said to be 2-arc-transitive if its full automorphism group Aut(\Gamma) has a single orbit on ordered paths of length 2, and for G\leq Aut(\Gamma), \Gamma is G-regular if G is regular on the vertex set of \Gamma. Let G be a…
It is a simple fact that a group has a trivial automorphism group if and only if it is of order $1$ or $2$. We prove that the same holds for certain families of skew braces, and given any odd prime $p$, we construct a skew brace of order…
Let $G=(V,E)$ be a simple connected graph. A set of vertices $S\subseteq V$ is said to be a dominating set if for any vertex in $V\setminus S$ is adjacent to at least one vertex in $S$. The domination number $\gamma(G)$ of $G$ is the…
We consider rational projective homogeneous varieties over an algebraically closed field of positive characteristic, namely quotients of a semi-simple group by a possibly non-reduced parabolic subgroup. We determine the group scheme…
Let $\Gamma$ be a graph and let $G$ be a group of automorphisms of $\Gamma$. The graph $\Gamma$ is called $G$-normal if $G$ is normal in the automorphism group of $\Gamma$. Let $T$ be a finite non-abelian simple group and let $G = T^l$ with…
We refer to $d(G)$ as the minimal cardinality of a generating set of a finite group $G$, and say that $G$ is $d$-generated if $d(G)\leq d$. A transitive permutation group $G$ is called $\frac{3}{2}$-transitive if a point stabilizer…
In this paper we give a non-computer-assisted proof of the following result: if $G$ is an even transitive group of degree $11$ and has a string C-group representation with rank $r\in\{4,5\}$ then $G\cong\PSL_2(11)$. Moreover this string…
Given integers $k$ and $m$, we construct a $G$-arc-transitive graph of valency $k$ and an $L$-arc-transitive oriented digraph of out-valency $k$ such that $G$ and $L$ both admit blocks of imprimitivity of size $m$.
Let $\mathscr{G}$ be the class of plane graphs without triangles normally adjacent to $8^{-}$-cycles, without $4$-cycles normally adjacent to $6^{-}$-cycles, and without normally adjacent $5$-cycles. In this paper, it is shown that every…
Given positive integers $p \ge k$, and a non-negative integer $d$, we say a graph $G$ is $(k,d,p)$-choosable if for every list assignment $L$ with $|L(v)|\geq k$ for each $v \in V(G)$ and $|\bigcup_{v\in V(G)}L(v)| \leq p$, there exists an…
In this paper, we examine a class of doubly resolvable combinatorial objects. Let $t, k, \lambda, s$ and $v$ be nonnegative integers, and let $X$ be a set of $v$ symbols. A generalized Howell design, denoted $t$-$GHD_{k}(s,v;\lambda)$, is…
A design is $G$-additive with $G$ an abelian group, if its points are in $G$ and each block is zero-sum in $G$. All the few known ``manageable" additive Steiner 2-designs are $\mathrm{EA}(q)$-additive for a suitable $q$, where…
Let $G$ be a simple algebraic group over an algebraically closed field $K$ of characteristic $p\geqslant 0$, let $H$ be a proper closed subgroup of $G$ and let $V$ be a nontrivial irreducible $KG$-module, which is $p$-restricted, tensor…
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…
The Johnson graph J(v,k) has, as vertices, the k-subsets of a v-set V, and as edges the pairs of k-subsets with intersection of size k-1. We introduce the notion of a neighbour-transitive code in J(v,k). This is a vertex subset \Gamma such…
We study lines through the origin of finite-dimensional complex vector spaces that enjoy a doubly transitive automorphism group. This paper classifies those lines that exhibit almost simple symmetries. We introduce a general recipe…
The distinguishing number of a graph $G$ is the smallest $k$ such that $G$ admits a $k$-colouring for which the only colour-preserving automorphism of $G$ is the identity. We determine the distinguishing number of finite $4$-valent…
With every nontrivial connected algebraic group $G$ we associate a positive integer ${\rm gtd}(G)$ called the generic transitivity degree of $G$ and equal to the maximal $n$ such that there is a nontrivial action of $G$ on an irreducible…