Papers › Optimal line packings from finite group actions
Optimal line packings from finite group actions
Joseph W. Iverson, John Jasper, Dustin G. Mixon
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We provide a general program for finding nice arrangements of points in real 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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections