English

Block-transitive two-designs based on grids

Combinatorics 2022-01-05 v1 Group Theory

Abstract

We study point-block incidence structures (P,B)(\mathcal{P},\mathcal{B}) for which the point set P\mathcal{P} is an m×nm\times n grid. Cameron and the fourth author showed that each block BB may be viewed as a subgraph of a complete bipartite graph Km,n\mathbf{K}_{m,n} with bipartite parts (biparts) of sizes m,nm, n. In the case where B\mathcal{B} consists of all the subgraphs isomorphic to BB, under automorphisms of Km,n\mathbf{K}_{m,n} fixing the two biparts, they obtained necessary and sufficient conditions for (P,B)(\mathcal{P},\mathcal{B}) to be a 22-design, and to be a 33-design. We first re-interpret these conditions more graph theoretically, and then focus on square grids, and designs admitting the full automorphism group of Km,m\mathbf{K}_{m,m}. We find necessary and sufficient conditions, again in terms of graph theoretic parameters, for these incidence structures to be tt-designs, for t=2,3t=2, 3, and give infinite families of examples illustrating that block-transitive, point-primitive 22-designs based on grids exist for all values of mm, and flag-transitive, point-primitive examples occur for all even mm. This approach also allows us to construct a small number of block-transitive 33-designs based on grids.

Keywords

Cite

@article{arxiv.2201.01143,
  title  = {Block-transitive two-designs based on grids},
  author = {Seyed Hassan Alavi and Ashraf Daneshkhah and Alice Devillers and Cheryl E. Praeger},
  journal= {arXiv preprint arXiv:2201.01143},
  year   = {2022}
}
R2 v1 2026-06-24T08:39:48.540Z