SearcharxivSearch

arXiv · 2505.04985

On flag-transitive automorphism groups of $2$-designs with $\lambda$ prime

Abstract

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 simple groups. If the socle of $G$ is a finite exceptional simple group, then we prove that $\mathcal{D}$ is isomorphic to one of two infinite families of $2$-designs with point-primitive automorphism groups, one is the Suzuki-Tits ovoid design with parameter set $(v,b,r,k,\lambda)=(q^{2}+1,q^{2}(q^{2}+1)/(q-1),q^{2},q,q-1)$ design, where $q-1$ is a Mersenne prime, and the other is newly constructed in this paper and has parameter set $(v,b,r,k,\lambda)=(q^{3}(q^{3}-1)/2,(q+1)(q^{6}-1),(q+1)(q^{3}+1),q^{3}/2,q+1)$, where $q+1$ a Fermat prime. If $T$ is a sporadic simple group, then we show that $\mathcal{D}$ is isomorphic to a unique design admitting a point-primitive automorphism group with parameter set $(v,b,r,k,\lambda)=(176,1100,50,2)$, $(12,22,11,6,5)$ or $(22,77,21,6,5)$.

Explore related subjects

Keep this discovery

BibTeXRIS

Seyed Hassan Alavi, Ashraf Daneshkhah, Alessandro Montinaro. 2025-05-08. On flag-transitive automorphism groups of $2$-designs with $\lambda$ prime. https://arxiv.org/abs/2505.04985

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR