Related papers: On flag-transitive imprimitive 2-designs

Let G be an automorphism group of a nontrivial t-(k^2,k,\lambda) design. In this paper, we prove that if G is block-transitive, then the socle of G cannot be a finite simple exceptional group of Lie type.

Let $\mathcal{D}$ be a non-trivial $G$-block-transitive $3$-$(v,k,1)$ design, where $T\leq G \leq \mathrm{Aut}(T)$ for some finite non-abelian simple group $T$. It is proved that if $T$ is a simple exceptional group of Lie type, then $T$ is…

To each supersimple $2-(n,4,\lambda)$ design $\mathcal{D}$ one associates a `Conway groupoid,' which may be thought of as a natural generalisation of Conway's Mathieu groupoid associated to $M_{13}$ which is constructed from $\mathbb{P}_3$.…

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…

There is a one-to-one correspondence between the point set of a group divisible design (GDD) with $v_1$ groups of $v_2$ points and the edge set of a complete bipartite graph $K_{v_1,v_2}$. A block of GDD corresponds to a subgraph of…

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,…

This paper was inspired by a paper by Blokhuis and Brouwer [Designs, Codes and Cryptography 65, 2012] in which a definition of a graph on the flags of a biplane is given, and they prove that the graph corresponding to the unique…

Non-Hermitian but ${\cal PT}-$symmetric quantum system of an $N-$plet of bosons described by the three-parametric Bose-Hubbard Hamiltonian $H(\gamma,v,c)$ is picked up, in its special exceptional-point limit $c \to 0$ and $\gamma \to v$, as…

If each edge (u,v) of a graph G=(V,E) is decorated with a permutation pi_{u,v} of k objects, we say that it has a permuted k-coloring if there is a coloring sigma from V to {1,...,k} such that sigma(v) is different from pi_{u,v}(sigma(u))…

A $2-(v,k,\lambda)$ directed design (or simply a $2-(v,k,\lambda)DD$) is super-simple if its underlying $2-(v,k,2\lambda)BIBD$ is super-simple, that is, any two blocks of the $BIBD$ intersect in at most two points. A $2-(v,k,\lambda)DD$ is…

Let $\phi(k)$ be the minimum number of vertices in a non-$k$-choosable $k$-chromatic graph. The Ohba conjecture, confirmed by Noel, Reed and Wu, asserts that $\phi(k) \ge 2k+2$. This bound is tight if $k$ is even. If $k$ is odd, then it is…

Using Grothendieck's "functor of points" approach to algebraic geometry, we define a new infinite-dimensional algebro-geometric flag space as a $k$-functor (for $k$ a ring) which maps a $k$-algebra $R$ to the set of certain well-ordered…

A notion of $t$-designs in the symmetric group on $n$ letters was introduced by Godsil in 1988. In particular $t$-transitive sets of permutations form a $t$-design. We derive special lower bounds for $t=1$ and $t=2$ by a power moment…

Let $\Psi(t,k)$ denote the set of pairs $(v,\lambda)$ for which there exists a graphical $t$-$(v,k,\lambda)$ design. Most results on graphical designs have gone to show the finiteness of $\Psi(t,k)$ when $t$ and $k$ satisfy certain…

A k-regular graph on v vertices is a divisible design graph with parameters (v, k, lambda_1 ,lambda_2, m, n) if its vertex set can be partitioned into m classes of size n, such that any two different vertices from the same class have…

We consider a 2-homogeneous bipartite distance-regular graph $\Gamma$ with diameter $D \geq 3$. We assume that $\Gamma$ is not a hypercube nor a cycle. We fix a $Q$-polynomial ordering of the primitive idempotents of $\Gamma$. This…

Let $(\Sigma,p)$ be a pointed Riemann surface of genus $g\geq 1$. For any integer $k\geq 1$, we parametrize the space of meromorphic quadratic differentials on $\Sigma$ with a pole of order $(k+2)$ at $p$, having a connected critical graph…

An incidence structure consists simply of a set P of points and a set B of blocks, with a relation of incidence between points and blocks.A symmetric (v,k,\lambda) block design is the subject of this paper. The symmetric (n^2+n+1, n+1,1)…

The classification of flag-transitive generalised quadrangles is a long-standing open problem at the interface of finite geometry and permutation group theory. Given that all known flag-transitive generalised quadrangles are also…

The conjugacy classes of nilpotent $n\times n$ matrices can be parametrised by partitions $\lambda$ of $n$, and for a nilpotent $\eta$ in the class parametrised by $\lambda$, the variety $F_\eta$ of $\eta$-stable flags has its irreducible…