Bounds on antipodal spherical designs with few angles
Abstract
A finite subset X on the unit sphere Sd-1 is called an s-distance set with strength t if its angle set A(X):=\ x,y : x,y∈ X,x≠y \ has size s, and X is a spherical t-design but not a spherical (t+1)-design. In this paper, we consider to estimate the maximum size of such antipodal set for small s. First, we improve the known bound on |X| for each even integer s∈[t+52, t+1] when t≥ 3. We next focus on two special cases: s=3,\ t=3 and s=4,\ t=5. Estimating the size of X for these two cases is equivalent to estimating the size of real equiangular tight frames (ETFs) and Levenstein-equality packings, respectively. We first improve the previous estimate on the size of real ETFs and Levenstein-equality packings. This in turn gives a bound on |X| when s=3,\ t=3 and s=4,\ t=5, respectively.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.