English

Rational Angle Sets and Tight t-Designs

Combinatorics 2023-02-06 v1

Abstract

Given a finite subset of a sphere or projective space, known as a design, we can compute the strength and angle set of that design. When the strength and angle set meet certain bounds, the design is called tight. Hoggar sought to prove that, aside from certain known cases, the angle sets of tight projective designs must be rational. Lyubich found a counter-example and provided a repair for Hoggar's proof but excluded the exceptional octonion projective cases. This note extends Lyubich's repair of Hoggar's proof to the remaining projective cases and extends the proof to all spherical cases. It does so by using Jordan algebra primitive idempotents to treat all of the cases simultaneously. We thereby confirm that tight spherical and projective designs have rational angle sets except in specific cases.

Keywords

Cite

@article{arxiv.2302.01484,
  title  = {Rational Angle Sets and Tight t-Designs},
  author = {Benjamin Nasmith},
  journal= {arXiv preprint arXiv:2302.01484},
  year   = {2023}
}

Comments

11 pages

R2 v1 2026-06-28T08:30:56.629Z