2000 character limit reached
Reduction for flag-transitive symmetric designs with $k>λ(λ-2)$
Published 20 Feb 2023 in math.CO and math.GR | (2302.09768v1)
Abstract: Let $G$ be a flag-transitive automorphism group of a $(v,k,\lambda)$ symmetric design $\mathcal{D}$ with $k>\lambda(\lambda-2)$. O'Reilly Regueiro proved that if $G$ is point-imprimitive, then $\mathcal{D}$ has parameters $(v,k,\lambda)=(\lambda2(\lambda+2),\lambda(\lambda+1),\lambda)$. In the present paper, we consider the case that $G$ is point-primitive. By applying the O'Nan-Scott Theorem, we prove that $G$ must be of affine type or almost simple type.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.