2000 character limit reached
Doubly transitive lines I: Higman pairs and roux (1806.09037v3)
Published 23 Jun 2018 in math.CO, cs.IT, math.FA, math.IT, and math.MG
Abstract: We study lines through the origin of finite-dimensional complex vector spaces that enjoy a doubly transitive automorphism group. In doing so, we make fundamental connections with both discrete geometry and algebraic combinatorics. In particular, we show that doubly transitive lines are necessarily optimal packings in complex projective space, and we introduce a fruitful generalization of regular abelian distance-regular antipodal covers of the complete graph.
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.
