2016
DOI: 10.1016/j.laa.2016.09.005
|View full text |Cite
|
Sign up to set email alerts
|

Achieving the orthoplex bound and constructing weighted complex projective 2-designs with Singer sets

Abstract: Equiangular tight frames are examples of Grassmannian line packings for a Hilbert space. More specifically, according to a bound by Welch, they are minimizers for the maximal magnitude occurring among the inner products of all pairs of vectors in a unit-norm frame. This paper is dedicated to packings in the regime in which the number of frame vectors precludes the existence of equiangular frames. The orthoplex bound then serves as an alternative to infer a geometric structure of optimal designs. We construct f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
44
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
7
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 33 publications
(44 citation statements)
references
References 36 publications
0
44
0
Order By: Relevance
“…Among the results that we discuss in the classical setting are BIBDs as the support set of distance maximizers. This was realized in a prior paper in a special case in which probability vectors had a support that was half the number of outcomes/vertices [14]. Here, in Corollary 2.24, we deduce that a family of designs on q vertices, where q is a prime power, n = q(q m − 1)/(q − 1) blocks of size k = q m−1 , intersecting in at most q m−1 vertices gives rise to n probability vectors that saturate a bound by Rankin for packings in a simplex while purity is limited by 1/k.…”
Section: Introductionmentioning
confidence: 99%
“…Among the results that we discuss in the classical setting are BIBDs as the support set of distance maximizers. This was realized in a prior paper in a special case in which probability vectors had a support that was half the number of outcomes/vertices [14]. Here, in Corollary 2.24, we deduce that a family of designs on q vertices, where q is a prime power, n = q(q m − 1)/(q − 1) blocks of size k = q m−1 , intersecting in at most q m−1 vertices gives rise to n probability vectors that saturate a bound by Rankin for packings in a simplex while purity is limited by 1/k.…”
Section: Introductionmentioning
confidence: 99%
“…Using Theorem 2.2, one can determine a set that is optimal with respect to {f i } d+1 i=1 in the sense of Definition 2.1. The bound in (2.1) is similar to the orthoplex bound [31].…”
Section: Constructing Low Coherence Untfs With Block Designsmentioning
confidence: 54%
“…Again assuming {ϕ j } j∈K is a regular simplex, all that remains to be shown is that any sequence of scalars {c j } j∈K that satisfies (12) is a Naimark complement of it. From above, we know the aforementioned sequence {ĉ j } j∈K is a Naimark complement for {ϕ j } j∈K and so satisfies (12). If {c j } j∈K also satisfies (12), then both sequences lie in the null space of the synthesis operator Φ K of the regular simplex.…”
Section: Finding the Regular Simplices Contained In An Equiangular Timentioning
confidence: 98%