Related papers: A classification of flag-transitive block designs
Group action is a standard approach to obtain $t$-designs. In this approach, selecting a specific permutation group with a certain degree of transitivity or homogeneity and a proper set of base blocks is important for obtaining $t$-$(v, k,…
In this paper, we construct new families of flag-transitive linear spaces with $q^{2n}$ points and $q^{2}$ points on each line that admit a one-dimensional affine automorphism group. We achieve this by building a natural connection with…
In this note, we give a precise construction of one of the families of $2$-designs arose from studying flag-transitive $2$-designs with parameters $(v,k,\lambda)$ whose replication numbers $r$ are coprime to $\lambda$. We show that for a…
The purpose of this paper is to classify all pairs $(\mathcal{D}, G)$, where $\mathcal{D}$ is a non-trivial $2$-$(v, k, 2)$ design, and $G\leq Aut(\mathcal{D})$ acts transitively on the set of blocks of $\mathcal{D}$ and primitively on the…
In this paper, we consider finite flag-transitive affine planes with a solvable automorphism group. Under a mild number-theoretic condition involving the order and dimension of the plane, the translation complement must contain a linear…
This paper studies the long-standing open problem of the reduction of Steiner 3-designs admitting a block-transitive automorphism group. We prove that if G acts as a point-primitive, block-transitive automorphism group of a nontrivial…
Let $\mathcal{D}=(\mathcal{P},\mathcal{B})$ be a non-trivial block-transitive $t$-$(k^2,k,\lambda)$ design with $G\leq \Aut(\mathcal{D})$ and $X\unlhd G\leq \Aut(X)$, where $X=PSL(n,q)(n\geq3).$ We prove that $t=2$ and the parameters…
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…
We establish the existence of simple designs with parameters $2$-$(55,10,4)$, $3$-$(20,5,4)$, $3$-$(21,7,30)$, $4$-$(15,5,2)$, $4$-$(16,8,45)$, $5$-$(16,7,10)$, and $5$-$(17,8,40)$, which have previously been unknown. For the corresponding…
A graph $\Gamma$ is $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of arcs of $\Gamma$, where an arc is an ordered pair of adjacent vertices. Let $\Gamma$ be a $G$-symmetric graph such that its…
A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…
Let PG$(\mathbb{F}_q^v)$ be the $(v-1)$-dimensional projective space over $\mathbb{F}_q$ and let $\Gamma$ be a simple graph of order ${q^k-1\over q-1}$ for some $k$. A 2$-(v,\Gamma,\lambda)$ design over $\mathbb{F}_q$ is a collection $\cal…
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,…
Ostrom and Wagner (1959) proved that if the automorphism group $G$ of a finite projective plane $\pi$ acts $2$-transitively on the points of $\pi$, then $\pi$ is isomorphic to the Desarguesian projective plane and $G$ is isomorphic to…
Recently, Leemans and Stokes constructed an infinite family of incidence geometries admitting trialities but no dualities from the groups PSL(2,q) (where $q=p^{3n}$ with $p$ a prime and $n>0$ a positive integer). Unfortunately these…
Let $\Gamma$ be a $G$-symmetric graph with vertex set $V$. We suppose that $V$ admits a $G$-partition $\mathcal{B} = \{ B_0, ... , B_b \}$, with parts of size $v$, and that the quotient graph induced on $\mathcal B$ is a complete graph of…
This paper is a further contribution to the classification of line-transitive finite linear spaces. We prove that if S is a non-trivial finite linear space with the Fang-Li parameter gcd(k,r) is 9 or 10, the automorphism group G of S is…
In 1991, Weidong Fang and Huiling Li proved that there are only finitely many non-trivial linear spaces that admit a line-transitive, point-imprimitive group action, for a given value of gcd(k,r), where k is the line size and r is the…
Block-transitive Steiner $t$-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory,…
A graph $\Ga$ is $G$-symmetric if $\Ga$ admits $G$ as a group of automorphisms acting transitively on the set of vertices and the set of arcs of $\Ga$, where an arc is an ordered pair of adjacent vertices. In the case when $G$ is…