Abstract

A finite subset $X$ on the unit sphere $\mathbb{S}^d$ is called an $s$-distance set with strength $t$ if its angle set $A(X):=\{\langle \mathbf{x},\mathbf{y}\rangle : \mathbf{x},\mathbf{y}\in X, \mathbf{x}\neq\mathbf{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 $X$ for small $s$. Motivated by the method developed by Nozaki and Suda, for each even integer $s\in[\frac{t+5}{2}, t+1]$ with $t\geq 3$, we improve the best known upper bound of Delsarte, Goethals and Seidel. 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 improve the previous estimate on the size of real ETFs and Levenstein-equality packings. This in turn gives an upper bound on $|X|$ when $s=3,\ t=3$ and $s=4,\ t=5$, respectively.

Highlights

  • A finite set X ⊂ Sd−1 is called an s-distance set if its angle set A(X) := { x, y : x, y ∈ X, x = y} contains s distinct values, and we say X has strength t if t is the largest integer such that X is a spherical t-design

  • T ∈ Z+, what is the maximum size of an s-distance set X ⊂ Sd−1 with strength t?

  • We introduce another result on the existence of real equiangular tight frames (ETFs)

Read more

Summary

Spherical designs with few angles

A finite set X ⊂ Sd−1 is called an s-distance set if its angle set A(X) := { x, y : x, y ∈ X, x = y} contains s distinct values, and we say X has strength t if t is the largest integer such that X is a spherical t-design. We say that a finite set X ⊂ Sd−1 is a spherical t-design if the following equality. Estimating the size of these designs provides a necessary condition on their existence. We aim to bound the size of antipodal s-distance sets in Sd−1 with strength t. Recall that the strength of an antipodal set must be an odd integer [12, Theorem 5.2]. S−1 provided X ⊂ Sd−1 is an antipodal s-distance set with strength t. In this paper we will focus on estimating the size of X when 2s is slightly greater than t + 1

The optimal line packing problem
Related work
The general case
Organization
Notations
Spherical designs
Spherical embeddings of strongly regular graphs
Proof of Theorem 2
Proof of Theorem 3
Proof of Theorem 7

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.