English

Simple $3$-designs of $\mathrm{PSL}(2,2^n)$ with block size $13$

Combinatorics 2025-03-21 v1

Abstract

This paper investigates simple 33-(2n+1,13,λ)(2^n+1,13,\lambda) designs admitting PSL\mathrm{PSL}(2,2n)(2,2^n) as an automorphism group. We determine all possible values of λ\lambda by systematically analyzing the orbits of 1313-element subsets under the action of PSL\mathrm{PSL}(2,2n)(2, 2^n) on the projective line. While previous research has explored this topic by analyzing the structure of kk-element subsets BB directly, we approach the problem using group theory and the Cauchy-Frobenius-Burnside lemma. This method provides an efficient framework that can be applied to larger block sizes where traditional enumeration methods become computationally infeasible.

Keywords

Cite

@article{arxiv.2503.16050,
  title  = {Simple $3$-designs of $\mathrm{PSL}(2,2^n)$ with block size $13$},
  author = {Takara Kondo and Yuto Nogata},
  journal= {arXiv preprint arXiv:2503.16050},
  year   = {2025}
}

Comments

24 pages, uses platex