Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T06:44:37.417Z Has data issue: false hasContentIssue false

OPTIMAL LINE PACKINGS FROM FINITE GROUP ACTIONS

Published online by Cambridge University Press:  20 January 2020

JOSEPH W. IVERSON
Affiliation:
Department of Mathematics, University of Maryland, College Park, MD 20742, USADepartment of Mathematics, Iowa State University, Ames, IA 50011, USA; jwi@iastate.edu
JOHN JASPER
Affiliation:
Department of Mathematics and Statistics, South Dakota State University, Brookings,SD 57007, USA; john.jasper@sdstate.edu
DUSTIN G. MIXON
Affiliation:
Department of Mathematics, The Ohio State University, Columbus, OH 43210, USA; mixon.23@osu.edu

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We provide a general program for finding nice arrangements of points inreal or complex projective space from transitive actions of finite groups. In many cases, these arrangements are optimal in the sense of maximizing the minimum distance. We introduce our program in terms of general Schurian association schemes before focusing on the special case of Gelfand pairs. Notably, our program unifies a variety of existing packings with heretofore disparate constructions. In addition, we leverage our program to construct the first known infinite family of equiangular lines with Heisenberg symmetry.

Information

Type
Discrete Mathematics
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s) 2020