Papers
Topics
Authors
Recent
Search
2000 character limit reached

Rational Angle Sets and Tight t-Designs

Published 3 Feb 2023 in math.CO | (2302.01484v1)

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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.