SearcharxivSearch

arXiv · 2510.25360

The Flag-Transitive and Point-Imprimitive Symmetric $(v,k,\lambda)$ Designs with $v<100$

Abstract

A complete classification of the flag-transitive point-imprimitive symmetric $2$-$(v,k,\lambda )$ designs with $v<100$ is provided. Apart from the known examples with $\lambda \leq 10$, the complementary design of $PG_{5}(2)$, and the $2$-design $\mathcal{S}^{-}(3)$ constructed by Kantor in \cite{Ka75}, we found two non isomorphic $2$-$(64,28,12)$ designs. They were constructed via computer as developments of $(64,28,12)$-difference sets by AbuGhneim in \cite{OAG}. In the present paper, independently from \cite{OAG}, we construct the aforementioned two $2$-designs and we prove that their full automorhpism group is flag-transitive and point-imprimitive. The construction is theoretical and relies on the the absolutely irreducible $8$-dimensional $\mathbb{F}_{2}$-representation of $PSL_{2}(7)$. Our result, together with that about the flag-transitive point-primitive symmetric $2$-designs with $v<2500$ by Brai\'{c}-Golemac-Mandi\'{c}-Vu\v{c}i\v{c}i\'{c} \cite{BGMV}, provides a complete classification of the flag-transitive $2$-designs with $v<100$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mario Galici, Alessandro Montinaro. 2025-10-29. The Flag-Transitive and Point-Imprimitive Symmetric $(v,k,\lambda)$ Designs with $v<100$. https://arxiv.org/abs/2510.25360

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