Related papers: Completely Transitive Designs

Let $q$ be a prime power and $V\cong{\mathbb F}_q^n$. A $t$-$(n,k,\lambda)_q$ design, or simply a subspace design, is a pair ${\mathcal D}=(V,{\mathcal B})$, where ${\mathcal B}$ is a subset of the set of all $k$-dimensional subspaces of…

We study block designs which admit an automorphism group that is transitive on blocks and points, and leaves invariant every partition in a given finite poset of partitions of the point set. The full stabiliser $G$ of all the partitions in…

The paper is an investigation of the structure of block-transitive automorphism groups of a 3-design with small block size. Let $G$ be a block-transitive automorphism group of a nontrivial $3$-$(v,k,\lambda)$ design $\mathcal{D}$ with $k\le…

More than $30$ years ago, Delandtsheer and Doyen showed that the automorphism group of a block-transitive $2$-design, with blocks of size $k$, could leave invariant a nontrivial point-partition, but only if the number of points was bounded…

We give a construction of a family of designs with a specified point-partition, and determine the subgroup of automorphisms leaving invariant the point-partition. We give necessary and sufficient conditions for a design in the family to…

We consider $2$-designs which admit a group of automorphisms that is flag-transitive and leaves invariant a chain of nontrivial point-partitions. We build on our recent work on $2$-designs which are block-transitive but not necessarily…

Let $\mathcal{D}$ be a nontrivial $3$-$(v,k,1)$ design admitting a block-transitive group $G$ of automorphisms. A recent work of Gan and the second author asserts that $G$ is either affine or almost simple. In this paper, it is proved that…

It was shown in 1989 by Delandtsheer and Doyen that, for a $2$-design with $v$ points and block size $k$, a block-transitive group of automorphisms can be point-imprimitive (that is, leave invariant a nontrivial partition of the point set)…

A $3$-$(v,\{4,6\},1)$ design is a configuration of $v$ points and a collection of $4$- and $6$-element subsets called blocks, that jointly contain every 3-element subset exactly once. Using an exhaustive computer search on $v\leq 28$ points…

In this article, we study $2$-$(v,k,\lambda)$ designs $\mathcal{D}$ with $\lambda$ prime admitting flag-transitive and point-primitive almost simple automorphism groups $G$ with socle $T$ a finite exceptional simple group or a sporadic…

For each finite classical group $G$, we classify the subgroups of $G$ which act transitively on a $G$-invariant set of subspaces of the natural module, where the subspaces are either totally isotropic or nondegenerate. Our proof uses the…

We classify the pairwise transitive 2-designs, that is, 2-designs such that a group of automorphisms is transitive on the following five sets of ordered pairs: point-pairs, incident point-block pairs, non-incident point-block pairs,…

For a finite alphabet $\mathcal{A}$ and shift $X\subseteq\mathcal{A}^{\mathbb{Z}}$ whose factor complexity function grows at most linearly, we study the algebraic properties of the automorphism group ${\rm Aut}(X)$. For such systems, we…

The completely regular codes in Hamming graphs have a high degree of combinatorial symmetry and have attracted a lot of interest since their introduction in 1973 by Delsarte. This paper studies the subfamily of completely transitive codes,…

This paper investigates $2$-$(v,5,\lambda)$ designs $\mathcal{D}$ admitting a block-transitive automorphism group $G$. We first prove that if $G$ is point-imprimitive, then $v$ must be one of 16, 21, or 81. We further provide a complete…

We study point-block incidence structures $(\mathcal{P},\mathcal{B})$ for which the point set $\mathcal{P}$ is an $m\times n$ grid. Cameron and the fourth author showed that each block $B$ may be viewed as a subgraph of a complete bipartite…

Comparability graphs are graphs which have transitive orientations. The dimension of a poset is the least number of linear orders whose intersection gives this poset. The dimension ${\rm dim}(X)$ of a comparability graph $X$ is the…

Let $X$ be a finite vertex-transitive graph of valency $d$, and let $A$ be the full automorphism group of $X$. Then the arc-type of $X$ is defined in terms of the sizes of the orbits of the action of the stabiliser $A_v$ of a given vertex…

In this article, we study $2$-designs with $\gcd(r, \lambda)=1$ admitting a flag-transitive automorphism group. The automorphism groups of these designs are point-primitive of almost simple or affine type. We determine all pairs…

Let $\mathcal{D} = (\mathcal{P}, \mathcal{B})$ be a $2$-$(v, k, \lambda)$ design, and let $G$ be a half-flag-transitive automorphism group of ${\cal D}$. In this article, we first establish three sufficient conditions for $G$ to be…