On the construction of equiangular frames from graphs

84 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Upper bounds for $s$-distance sets and equiangular lines (2016, methodology): “When proving that G is strongly regular, we didn’t use that N is precisely (a 2−3)a2 2 so this part essentially gives a new self-contained proof for the classification of equiangular tight frames and their connection to strongly regular graphs with parameters (N, k, 3k−N−1 2 , k 2 ) (see, for instan”
Steiner equiangular tight frames (2010, methodology): “Moreover, Theorem 2 implies that not even every ETF with N M > 2 arises from a Steiner system: though there exists an ETF of 76-elements in R19 [30], the corresponding parameters of the design would be v = 38 3 , r = 5 and k = 10 3 , not all of which are integers.”