Lattices from tight frames and vertex transitive graphs

We show that real tight frames that generate lattices must be rational. In the case of irreducible group frames, we show that the corresponding lattice is always strongly eutactic. We use this observation to describe a construction of strongly eutactic lattices from vertex transitive graphs. We show that such lattices exist in arbitrarily large dimensions and discuss some examples arising from complete graphs, product graphs, as well as some other notable examples of graphs. In particular, some well-known root lattices and those related to them can be recovered this way. We discuss various properties of this construction and also mention some potential applications of lattices generated by incoherent systems of vectors.


Introduction
Let , be the usual inner product on R k and }x} :" x, x 1{2 the Euclidean norm on R k . For a lattice L Ă R k of full rank k (that is a discrete co-compact subgroup of R k ) the minimal norm of L is |L| :" mint}x} : x P Lzt0uu, and its set of minimal or shortest vectors is SpLq :" tx P L : }x} " |L|u.
The automorphism group of the lattice L, AutpLq, is the group of all kˆk real orthogonal matrices that map L to itself. A particularly interesting class of lattices are eutactic lattices: a lattice L is called eutactic if its set of minimal vectors SpLq satisfies a eutaxy condition, i.e. there exist positive real numbers c 1 , . . . , c n , (called eutaxy coefficients) such that (1) }v} 2 " ÿ xPSpLq c i v, x i 2 for all v P R k . If c 1 "¨¨¨" c n , L is said to be strongly eutactic. Eutactic and strongly eutactic lattices are central objects of lattice theory due to their importance in connection with well studied optimization problems. A theorem of Voronoi (1908) asserts that L is a local maximum of the packing density function on the space of lattices in R k if and only if it is eutactic and perfect (L is perfect if the set tx J x : x P SpLqu spans the space of kˆk real symmetric matrices) [Vor08]. More details on eutactic, strongly eutactic and perfect lattices can be found in J. Martinet's book [Mar03]. Two lattices L and M are called similar, written L " M , if L " αU M for a nonzero scalar α and an orthogonal transformation U . Similarity is an equivalence relation on lattices that preserves inner products between vectors and, as a result, lattice's automorphism group; it also gives a bijection between sets of minimal vectors. Consequently, all the geometric properties that we discuss here, such as eutaxy, strong eutaxy and perfection are preserved on similarity classes.
In the previous papers [BFG`16] and [BF17] of the first two authors lattices generated by equiangular tight frames (ETFs) were studied and examples of strongly eutactic such lattices were constructed. Here we aim to take this discussion further. Let n ě k and let F :" tf 1 , . . . , f n u Ă R k be a set of vectors, not necessarily distinct, such that span R tf 1 , . . . , f n u " R k . Such a set F is called an pn, kq-frame, the name originating in a 1952 paper of Duffin and Schaeffer in connection with their study of nonharmonic Fourier series [DS52]. A frame F is called uniform if all of its vectors have the same norm, and it is called tight if there exists a real constant γ ą 0 such that for every v P R k (2) }v} 2 " γ n ÿ i"1 xv, f i y 2 , and the tight frame is called Parseval if γ " 1: clearly, any tight frame can be rescaled to a Parseval frame. Notice the similarity between this equation and the equation (1) above. Although the tightness condition (2) above is well studied in several contemporary branches of mathematics, the closely related eutaxy condition precedes it by half a century. Voronoi's study [Vor08] of quadratic forms in 1908 gave rise to the introduction of eutaxy condition (1). Nonetheless, we can say that a lattice is strongly eutactic whenever its set of minimal vectors forms a uniform tight frame. Another way to view uniform tight frames is as spherical 2-designs, a subclass of more general spherical t-designs introduced by Delsarte, Goethals, and Seidel in their groundbreaking 1977 paper [DGS91]. A special class of tight frames are examples of optimal packings of lines in projective space. These uniform tight frames are called equiangular (abbreviated ETF) ifˇˇ f i , f j ˇˇi s the same for all i ‰ j. Tight frames in general and ETFs in particular are extensively studied objects in harmonic analysis; see S. Waldron's book [Wal18] for detailed information on this subject.
If we write B for the kˆn matrix with vectors f 1 , . . . , f n as columns, then LpFq " tBa : a P Z n u.
The norm-form associated with F is the quadratic form (3) Q F paq " }Ba} 2 " xB J Ba, ay.
We call the frame F rational if Q F is (a constant multiple of) a rational quadratic form, i.e. the nˆn Gram matrix B J B is (a constant multiple of) a rational matrix. This is equivalent to saying that the inner products f i , f j are (up to a constant multiple) rational numbers for all 1 ď i, j ď n. In [BF17], it was proved that if F is rational, then LpFq is a lattice. Further, in the case that F is an ETF, LpFq is a lattice if and only if F is rational (the converse was previously proved in [BFG`16]). More generally, it was shown in [BF17] that when the dimension k " 2 or 3 and F is a tight pn, kq-frame for any n so that LpFq is a lattice, then F must be rational. Our first result is an extension of this observation to any dimension.
Theorem 1. Suppose that F is a uniform tight pn, kq-frame so that LpFq is a lattice. Then F must be rational.
We give two different proofs of Theorem 1 in Section 2, one of them as a consequence of a stronger result about a larger class of matrices than just the tight frames. We can now use this result to pick out lattices generated by tight frames. We are especially interested in frames that give rise to lattices with nice geometric properties. For this we need some more notation. Let the automorphism group of a frame F be where O k pRq is the group of nˆn real orthogonal matrices. As usual, we write H ď G to indicate that H is a subgroup of the group G.
We now discuss group frames; see Chapter 10 of [Wal18] for a detailed exposition. Let f 1 P R k be a vector and let G a finite group of orthogonal kˆk matrices. Define F to be the orbit of f 1 under the action of G by left multiplication, i.e.
F " Gf 1 :" tU f 1 : U P Gu , then all the vectors in F have the same norm. If F spans R k , then F is a uniform frame, which we refer to as a G-frame. G is said to act irreducibly on the space R k if there is no nonzero proper subspace E of R k that is closed under the action of G, that is, GE ‰ E for any t0u ‰ E Ĺ R k . A G-frame with such an irreducible action corresponding to G on R k is similarly called irreducible. All irreducible group frames are tight. In fact, if G is a group with an irreducible action on R k , then the orbit of x under G, tU x : U P Gu, is an irreducible tight G-frame for any nonzero vector x P R k (see Sections 10.5 -10.9 of [Wal18] for details).
Our next result demonstrates a certain two-way correspondence between irreducible group frames and strongly eutactic lattices.
Theorem 2. Let G be a group of kˆk real orthogonal matrices and f P R k be a vector so that F " Gf is an irreducible rational group frame in R k . Then the lattice LpFq is strongly eutactic. Conversely, suppose L Ă R k is a strongly eutactic lattice of rank k. Then its set of minimal vectors SpLq forms a uniform tight frame in R k . If in addition AutpLq acts transitively on SpLq, then SpLq is an AutpLq-frame, and if the action of AutpLq on R k is irreducible then SpLq is an irreducible group frame.
We prove Theorem 2 in Section 3. This theorem raises a question: which irreducible group frames are rational? One steady source of such frames comes from vertex transitive graphs, as detailed in Section 10.7 of [Wal18].
Theorem 3. Let Γ be a vertex transitive graph on n vertices and G its automorphism group. Let A be the adjacency matrix of Γ and λ an eigenvalue of multiplicity m. Assume λ is rational and let V λ be the corresponding m-dimensional eigenspace to eigenvalue λ. Let P λ be a rational orthogonal projection matrix of R n onto V λ . Then the lattice L Γ,λ :" P λ Z n in V λ is strongly eutactic, has rank m and its automorphism group contains G.
We review all the necessary notation and prove Theorem 3 in Section 4. There are plenty of examples of vertex transitive graphs with rational eigenvalues. In fact, for any n, there exist such lattices on n vertices having eigenvalues of multiplicity m being an increasing function of n (for instance complete graphs, Kneser graphs, Johnson graphs, various product and line graphs, etc.), so that this construction yields strongly eutactic lattices in arbitrarily high dimensions. We demonstrate several examples of this construction in Section 4, some of which are summarized in Table 1. A separate collection of lattices coming from several Johnson graphs Jpn, 2q is given in Table 2 in Section 4. Furthermore, in Theorem 13 we give a characterization of lattices coming from product graphs in terms of tensor products and orthogonal direct sums of component lattices.
For the purposes of all of our examples and constructions, the lattices are viewed up to similarity and eigenspaces of graphs are identified with real Euclidean spaces R k for the appropriate dimension k equal to the multiplicity of the corresponding eigenvalue. Our examples have been computed in Maple [map] using online catalog [Bai] of distance regular graphs and online catalog [Mar] of strongly eutactic lattices. It can be seen from these examples that a graph and its complement produce the same lattices. This is true in general, as is shown in Proposition 14 in Section 4. At the end of Section 4 we also demonstrate an interesting correspondence between contact polytopes of lattices E6 , E7 and A3 and our construction of lattices from their skeleton graphs.
It is also interesting to consider Theorem 3 in view of the properties of eutactic configurations, i.e. finite sets of vectors satisfying the eutaxy condition (1). The famous theorem of Hadwiger ( [Mar03], Theorem 3.6.12) asserts that a set S of cardinality n in k-dimensional space V , n ą k, is eutactic if and only if it is an orthogonal projection onto V of an orthonormal basis in an n-dimensional space containing V . In fact, our construction considers precisely such a projection, namely the set of vectors tP λ e i u n i"1 where e 1 , . . . , e n is the standard basis in R n . This set is therefore eutactic by Hadwiger. Our result, however, implies more, specifically that in our setting these vectors generate a lattice whose set of minimal vectors is strongly eutactic.
Finally, in Section 5 we discuss a possible relation between coherence of a lattice and its sphere packing density, as well as potential applications of tight frames coming from sets of minimal vectors of lattices in compressed sensing.

Rationality of lattice-generating frames
We start with a simple proof of Theorem 1.
Proof of Theorem 1. With notation as in the statement of the theorem, let B be a kˆn real matrix whose columns are vectors of the tight frame F and LpFq is a lattice. Let A be a kˆk basis matrix for LpFq.
Since Z J pZZ J q´1Z has rational entries, we have that B J B is a multiple of a rational matrix. Therefore F is a rational tight frame.
The above argument implies that if Q F as in (3) is a quadratic form corresponding to an irrational tight frame F then the corresponding integer span LpFq is not a lattice (i.e. is not discrete) because Q F cannot be bounded away from 0 on integer points. This argument, however, relies heavily on the norm-form Q F coming from a tight frame. On the other hand, it is not difficult to construct other irrational quadratic forms (not corresponding to tight frames) which are bounded away from 0 on integer points. For instance, take L 1 , . . . , L k to be rational linear forms in n variables x 1 , . . . , x n and c 1 , . . . , c k any positive real numbers. Let Qpx 1 , ..., x n q " c 1 L 2 1`¨¨¨`ck L 2 k . This Q is a positive semidefinite quadratic form. Suppose Qpaq ‰ 0 for some integer vector a, then there must exist 1 ď i ď k such that L i paq ‰ 0. Since L i has rational coefficients, |L i paq| ě 1{d i , where d i is the least common multiple of the denominators of these coefficients. Let d " maxtd 1 , . . . , d k u and c " mintc 1 , . . . , c k u, then we have Qpaq ě c{d 2 for all a for which Qpaq ‰ 0. In particular, if some of the c i 's are irrational, Q is a form with irrational coefficients.
In view of this observation, it is interesting to understand what are the necessary and sufficient conditions on a kˆn real matrix B so that BZ n is a lattice to imply that B must be rational? In the rest of this section we prove a sufficient condition that is weaker than being a tight frame. Write tb i u n i"1 Ă R k for the elements of a frame F (a sequence of vectors spanning R k ), written as column vectors of a kˆn matrix B, where n " k`m. Let the first k columns in B be denoted in matrix form by B 0 and the remaining m column vectors by B 1 , so that B " rB 0 | B 1 s, B 0 P R kˆk , B 1 P R kˆm .
Lemma 4. Suppose that B " rB 0 | B 1 s is such that B 0 R k " R k and Λ B :" BZ n is discrete. Then Proof. If Λ B is discrete, it is a full-rank lattice in R k , and so has a basis matrix A "`a 1 . . . a k˘s uch that Λ B " AZ k . Hence there exist some integer matrices Z 0 , Z 1 such that AZ 0 " B 0 , and AZ 1 " B 1 . Since B 0 is full rank and A invertible, Z 0 is invertible and Let Q be an kˆk orthogonal real matrix, then multiplication by Q preserves inner products of vectors in R k . Hence a collection of vectors tb i u n i"1 generates a lattice over Z if and only if tQb i u n i"1 does. Let W be orthogonally equivalent to B, that is W " QB for some Q P O k pRq (O k pRq denotes the set of real kˆk orthogonal matrices). QQ J " I k , the kˆk identity matrix, so that the matrix of outer products for W is W W J " QBB J Q J . Having information about the entries of this matrix for certain Q (arising in this case from the QR-decomposition of a matrix) allows for an easy way to check rationality of inner products. When B is a tight frame given in matrix form, (as above) BB J " γI k for some γ ą 0, and so W W J collapses to the same matrix as BB J . In general, however the relationship between W W J and BB J can get "muddled" by transformation so that determining lattice properties of integer combinations of vectors in a tight frame is easier than the general case.
Remark 2.1. Given B 0 " QR, the QR factorization of B 0 , so that Q P O k pRq and R is upper-triangular with positive entries along the diagonal, it will be useful to work with the alternative representation of B: B " Q´1B " rR | Q´1B 1 s. Additionally, the entries ofB 0 ,B 1 may be given as where b i,i´1 are taken to be positive (possible since R has positive diagonal entries). From now on, let B denote a matrix of the formB when not specified otherwise.
Theorem 5. Suppose a collection of vectors B " tb i u n i"1 Ă R k , n " k`m, is given as column vectors of a matrix of the formB (as in the preceding remark). Suppose these column vectors have the following properties: Then the inner products xb i , b j y must all be rational, i.e. B J B P Q nˆn .
Proof. For each column vector b l from B, Lemma 4 implies there exists a vector p l P Q k such that B´1 0 b l " p l . We now use the rational numbers p i,j and q i,j to show that the inner products, which are the entries of B J B must be rational.
Recall that B has k rows and k`m columns. From now on, denote the last m column vectors of B by y l , 1 ď l ď m. The condition B´1 0 y l " p l gives that b k,k´1 p k,l " b k,k´1 y k,l , so y k,l " p k,l for all l " 1, . . . , m, i.e., the numbers y k,l are rational. In the same manner, we obtain m equations: b k´1,k´2 p k´1,l`bk´1,k´2 b k´1,k´1 p k,l " b k´1,k´2 y k´1,l , which imply that p k´1,l`bk´1,k´1 p k,l " y k´1,l for all l " 1, . . . , m, as well as b k,k´1 b k´1,k´2 pb k´1,k´1`yk´1,1 y k,1`¨¨¨`yk´1,m y k,m q " q k,k´1 b k,k´1 b k´1,k´2 , which implies b k´1,k´1`yk´1,1 y k,1`¨¨¨`yk´1,m y k,m " q k,k´1 . Now, these m`1 equations can be written together in a matrix equation: The matrix formed above on the left is invertible as all the rows of index greater than one are orthogonal to the first (this may be checked using the condition y k,l " p k,l ) and the lower right block being the negative identity shows the last m rows (arising from the first set of equalities above) are linearly independent amongst themselves. Thus by applying the inverse of the matrix on the left to each side we can express the coordinates b k´1,k´1 , y k´1,1 , . . . , y k´1,m of the vector on the left as rational numbers. Proceeding, the idea now is to induct on "levels" (each level is determined by the smallest index in the variables appearing in the matrix equations of the type above) supposing that all the variables appearing in the previous level (with the exception of variables of the form b i,i´1 which must be treated separately later) have been demonstrated to be rational. At the i-th such level the arising matrix equation analogous to the one above is of the form: As all entries in the matrix on the left appear in the left or right hand side vector of some matrix equation from a previous level, the inductive hypothesis implies that they are rational. A few observations are in order. The first i rows in the matrix above are linearly independent by the fact the first i column sub-matrix is upper-triangular with ones along the diagonal. Second, the remaining m row vectors have inner products with the first i row vectors which are zero as the expressions resulting in computing these inner products come exactly as the equations B 0 p l " y l . Lastly, note that the last m row vectors are linearly independent amongst themselves by the lower right block being minus the identity in R mˆm . Together, these observations justify the claim that the above matrix is invertible, so that the variables b k´i,k´i , b k´i,k´i`1 , . . . , b k´i,k´1 , y k´i,1 , . . . , y k´i,m may be expressed as rationals. This completes the inductive portion of the argument.
Reflect on what is known about the variables which have appeared in this process so far. For each i, the variables tb k´i,j u k´1 j"k´i have been shown to be rational along with the variables ty k´i,j u m j"1 . There is one set of equations which have not appeared yet, along with a set of variables which have yet to play a role (the variables b j,j´1 ). Treating these will be the last step of this argument.
The diagonal elements of BB J give rise to the equations where the convention is that a sum with starting index larger than the ending index is zero. For l " k, the corresponding equation is Since all of the variables y k,i , q k,k are rational, so is b 2 k,k´1 . An analogous argument establishes that b 2 l,l´1 is rational as in those equations, b l,j , q l,l and y l,j are rational (by the previous inductive argument). All that remains now is to compute the inner products. These are of the form which are all rational.
We now show that conditions of Theorem 5 include tight frames, thus providing an alternate proof of Theorem 1.
Corollary 6. Suppose that B " tb i u n i"1 Ă R k is a matrix with column vectors given by F, a Parseval tight frame. Then span Z F is discrete if and only if xb i , b j y are rational.
Proof. If the frame F is rational, then span Z F is a lattice by Proposition 1 of [BF17]. The reverse implication follows by setting q i,j " 0, i ‰ j and q i,i " 1 in Theorem 5 (after computing the QR decomposition of B).
Second proof of Theorem 1. Suppose that F " tf 1 , . . . , f n u is a uniform tight pn, kq-frame so that LpFq " span Z F is a lattice. Then for all v P R k , for an appropriate constant γ ą 0. Hence F 1 " ? γ F is a Parseval tight frame and span Z F 1 " ? γ LpFq is again a lattice. Then Corollary 6 implies that inner products of vectors in F 1 are rational, and so inner products of vectors in F are rational multiples of 1{γ.

Lattices from irreducible group frames
In this section we focus on group frames and lattices generated by them. As in Section 1, let f 1 P R k be a vector and let G a finite group of orthogonal kˆk matrices. Assume that F :" tU f 1 : U P Gu , spans R k , that is, it is a G-frame. If G is a cyclic group, F is called a cyclic frame. An example of a cyclic frame is the pk, k`1q-ETF discussed, for instance, in Section 5 of [BFG`16]: If G is an abelian group, F is a harmonic frame (see Section 11.3 of [Wal18], Theorem 11.1). Notice that for any G-frame F, G ď AutpFq. We also make a simple observation about the size of the G-frame F.
Lemma 7. Let F :" tU f 1 : U P Gu be a G-frame in R k , then |F| ď |G|. Further, |F| ă |G| if and only if f 1 if an eigenvector for some non-identity matrix W P G with the corresponding eigenvalue equal to 1.
Proof. The fact that |F| ď |G| is clear from the definition. Now assume |F| ă |G|. This means that for some two distinct U, V P G, U f 1 " V f 1 , hence V´1U f 1 " f 1 , meaning that f 1 is an eigenvector for V´1U with the corresponding eigenvalue equal to 1, and V´1U P G since G is a group. On the other hand, if f 1 if an eigenvector for some non-identity matrix W P G with the corresponding eigenvalue equal to 1, then W f 1 " f 1 , and so there are at most |G|´1 distinct vectors in F.
We now prove Theorem 2, splitting it into two lemmas.
Lemma 8. Suppose that F Ă R k is an irreducible G-frame and LpFq " span Z F is a lattice. Then LpFq is strongly eutactic.
Proof. The automorphism group of LpFq, AutpLpFqq, is the group of all orthogonal matrices that permute the lattice. Then we have G ď AutpFq ď AutpLpFqq, and the action of G on R k is irreducible. Let SpLpFqq be the set of minimal vectors of LpFq and let E " span R SpLpFqq. Since the automorphisms of LpFq permute the minimal vectors, it must be true that E is closed under the action of G. Thus we must have E " R k , and so G acts irreducibly on E, the space spanned by the minimal vectors of LpFq. Then Theorem 3.6.6 of [Mar03] guarantees that SpLpFqq is a strongly eutactic configuration, and hence LpFq is a strongly eutactic lattice.
Lemma 9. Let L Ă R k be a strongly eutactic lattice of full rank. Then its set of minimal vectors SpLq forms a uniform tight frame in R k . In addition, if AutpLq acts transitively on SpLq, then SpLq is a AutpLq-frame, and if the action of AutpLq on R k is irreducible then SpLq is an irreducible group frame.
Proof. By Corollary 16.1.3 of [Mar03], L is strongly eutactic if and only if its set SpLq of minimal vectors is a spherical 2-design, which is a condition equivalent to the tightness condition (2). Since all minimal vectors have the same norm, SpLq is a uniform tight frame. Now suppose some AutpLq acts transitively on SpLq. Let x 1 P SpLq, then for any x P SpLq there exists a U P AutpLq such that x " U x 1 . Hence SpLq " tU x 1 : U P AutpLqu, and so SpLq is an AutpLq-frame.

Vertex transitive graphs
Constructions of irreducible group frames from vertex transitive graphs are described in Section 10.7 of [Wal18]. We briefly review this subject here, proving Theorem 3 and providing some applications.
Let Γ be a graph on n vertices labeled by integers 1, . . . , n with automorphism group G :" AutpΓq. Γ is called vertex transitive if for each pair of vertices i, j there exists τ P G such that τ piq " j. From here on graphs considered will always be vertex transitive. Let e 1 , . . . , e n denote the standard basis vectors in R n . Then G acts on R n by τ˜n ÿ i"1 c i e i¸" n ÿ i"1 c i e τ piq for every τ P G and vector ř n i"1 c i e i P R n . Let A " pa ij q be the nˆn adjacency matrix of Γ, so that a ij " 1 if vertices i and j are connected by an edge and a ij " 0 otherwise. The condition that G is vertex transitive translates to a τ piqτ pjq " a ij for all τ P G. The matrix A is symmetric, with real eigenvalues λ 1 , . . . , λ k , each of multiplicity m λi , so that ř k i"1 m λi " n. From now on, we call these the eigenvalues of graph Γ. For each λ i let V λi Ă R n be the corresponding m λi -dimensional eigenspace. The group G acts irreducibly on each eigenspace V λi , hence for any nonzero vector v P V λi the orbit Gv of v under the action of G is an irreducible group frame in V λi -R mi . Further, if P λi is the orthogonal projection onto V λi , then for any τ P G and x P R n , τ pP λi pxqq " P λi pτ pxqq.
As indicated in Section 10.7 of [Wal18], this identity is true since the action of τ P G and the action of the adjacency matrix A on a vector commute, i.e.
Proof of Theorem 3. Suppose now that an eigenvalue λ i is an integer and the group G consists of integer matrices. Pick a nonzero integer vector x P R n . Then P λi x P V λi and the frame F λi pxq :" GP λi x " P λi pGxq is rational, and hence generates a strongly eutactic lattice LpF λi pxqq " span Z F λi pxq so that G ď AutpLpF λi qq. We will refer to lattices obtained in this manner as lattices generated by the graph Γ. Let us consider some examples of such lattices. For instance, let x " e 1 , then the corresponding frame F λi :" F λi pe 1 q consists of column vectors of P λi (possibly with repetitions), since τ e 1 is some e j for every τ P G, and every e j is representable as τ e 1 for some τ P G, since the graph is vertex transitive. We will refer to the corresponding lattice LpF λi q as just L λi , or as L Γ,λi when the graph Γ need be specified. These observations complete the proof of Theorem 3.
For the rest of this section, we consider examples of this lattice construction when applied to various graphs and their products. One class of lattices that will figure prominently in our examples are root lattices, that is, integral lattices generated by vectors of norm 2, which are called its roots (recall that a lattice is integral if the inner product between any two vectors is always an integer). Also recall that the dual lattice of a full rank lattice L Ă R n is L˚:" tx P R n : x, y P Z for all y P Lu .
If L is integral, then L Ď L˚.
Lemma 10. Let 0 n be a completely disconnected graph on n vertices, then 0 n generates the integer lattice Z n .
Proof. The adjacency matrix for 0 n is the nˆn 0-matrix, and so it has one eigenvalue 0 with multiplicity n with the corresponding eigenspace being the entire R n . The automorphism group of 0 n is S n , so the group frame obtained from the vector e 1 is the full standard basis, which spans the lattice Z n .
Lemma 11. The complete graph K n generates (a lattice similar to) the root lattice x P Z n : Proof. The complete graph K n is the graph on n vertices with no loops in which every vertex is connected to every other. Hence adjacency matrix A has 1's for all the off-diagonal entries and 0's on the diagonal. There are two eigenvalues: λ 1 "´1 with multiplicity n´1 and λ 2 " n´1 with multiplicity 1. The eigenspace corresponding to λ 2 is V n´1 " span R tp1, . . . , 1q J u and the eigenspace V´1 corresponding to λ 1 is the orthogonal complement of V n´1 in R n . The automorphism group of K n is S n . The orthogonal projection onto V´1 is given by , so the lattice L Kn,´1 generated by the columns of P´1 is the root lattice A n´1 " Z n X V´1 rescaled by the factor 1{pn´1q.
Next we consider graphs that are constructed as products of smaller graphs. We start with disjoint unions. In order for such a graph to be vertex transitive, all the components in the disjoint union need to be vertex transitive and isomorphic to each other. Hence we can think of them as copies of the same vertex transitive graph.
Lemma 12. Let Γ be a vertex transitive graph constructed as a disjoint union of k copies of a vertex transitive graph ∆. Let λ be a rational eigenvalue of ∆ and L ∆,λ be a lattice generated by the λ-eigenspace of ∆. Then Γ also has λ as an eigenvalue and generates a lattice given by the orthogonal sum of k copies of L ∆,λ .
Proof. Let m be the number of vertices of ∆ and let A ∆ be its adjacency matrix. Then the mkˆmk adjacency matrix A Γ of the graph Γ is a block matrix with diagonal mˆm blocks being A ∆ and the rest filled up with 0 blocks, i.e. Let us refer to a block matrix like this as À k pA ∆ q. A Γ has the same eigenvalues as A ∆ , but of k times greater multiplicity. Let V ∆,λ be the λ-eigenspace of A ∆ with the corresponding projection matrix P ∆,λ . The λ-eigenspace of A Γ is the orthogonal sum of k copies of V ∆,λ and the corresponding projection matrix is À k pP ∆,λ q. Hence the lattice L Γ,λ generated by the column vectors of this matrix is the orthogonal sum of k copies of L ∆,λ . Now we recall the three fundamental commutative product constructions of graphs (see [HIK11] and [IKR08] for detailed information). In each of these constructions, each eigenvalue ν of the product graph Γ is derived from a pair of eigenvalues λ and µ of the component graphs ∆ 1 and ∆ 2 , respectively, via some function f pλ, µq. This function f differs depending on which product we consider. Spectral properties of product graphs are nicely summarized in [Say16].
The Cartesian product of two graphs ∆ 1 and ∆ 2 , denoted ∆ 1˝∆2 , is the graph whose vertices are pairs pu, vq, where u is a vertex of ∆ 1 and v is a vertex of ∆ 2 , and two vertices pu 1 , v 1 q and pu 2 , v 2 q are connected by an edge if and only if either u 1 " u 2 and v 1 , v 2 are connected by an edge in ∆ 2 , or v 1 " v 2 and u 1 , u 2 are connected by an edge in ∆ 1 . Then ∆ 1˝∆2 is vertex transitive if and only if both ∆ 1 and ∆ 2 are vertex transitive ([GR01], Section 7.14, or [HIK11]). For each pair of eigenvalues λ of ∆ 1 and µ of ∆ 2 , there is an eigenvalue ν of ∆ 1˝∆2 given by ν " f pλ, µq :" λ`µ, and if u, v are corresponding eigenvectors of ∆ 1 , ∆ 2 , respectively, then u b v is an eigenvector of Γ corresponding to ν.
The direct product of two graphs ∆ 1 and ∆ 2 , denoted ∆ 1ˆ∆2 is the graph whose vertices are pairs pu, vq, where u is a vertex of ∆ 1 and v is a vertex of ∆ 2 , and two vertices pu 1 , v 1 q and pu 2 , v 2 q are connected by an edge if and only if both pairs u 1 , u 2 and v 1 , v 2 are connected by an edge in ∆ 1 , ∆ 2 , respectively. If ∆ 1 and ∆ 2 are vertex transitive, then ∆ 1ˆ∆2 is vertex transitive. The converse statement is not as straight-forward, and distinguishes between bipartite and non-bipartite graphs (see [HI18]). For each pair of eigenvalues λ of ∆ 1 and µ of ∆ 2 , there is an eigenvalue ν of ∆ 1ˆ∆2 given by ν " f pλ, µq :" λµ, and if u, v are corresponding eigenvectors of ∆ 1 , ∆ 2 , respectively, then u b v is an eigenvector of Γ corresponding to ν.
The strong product of two graphs ∆ 1 and ∆ 2 , denoted ∆ 1 b ∆ 2 , is the graph whose vertices are pairs pu, vq, where u is a vertex of ∆ 1 and v is a vertex of ∆ 2 , and two vertices pu 1 , v 1 q and pu 2 , v 2 q are connected by an edge if and only if u 1 , u 2 and v 1 , v 2 are either equal or connected by an edge in ∆ 1 , ∆ 2 , respectively. The graph ∆ 1 b ∆ 2 is vertex transitive if and only if both ∆ 1 and ∆ 2 are vertex transitive (Section 7.4 of [HIK11]). For each pair of eigenvalues λ of ∆ 1 and µ of ∆ 2 , there is an eigenvalue ν of ∆ 1 b ∆ 2 given by ν " f pλ, µq :" pλ`1qpµ`1q´1, and if u, v are corresponding eigenvectors of ∆ 1 , ∆ 2 , respectively, then u b v is an eigenvector of Γ corresponding to ν.
The lexicographic product of two vertex transitive graphs ∆ 1 and ∆ 2 is a vertex transitive graph whose vertices are pairs pu, vq, where u is a vertex of ∆ 1 and v is a vertex of ∆ 2 , and two vertices pu 1 , v 1 q and pu 2 , v 2 q are connected by an edge if and only if either u 1 , u 2 are connected in ∆ 1 , or u 1 " u 2 and v 1 , v 2 are connected in ∆ 2 .
For two vectors x P R m1 , y P R m2 and m 1ˆm1 , m 2ˆm2 matrices A, B, respectively, we have where b stands for the usual Kronecker (outer) product of matrices and vectors. Further, if two vectors x 1 , x 2 P R m1 are orthogonal and y P R m2 , then simple tensors x 1 b y and x 2 b y are also orthogonal.
Theorem 13. Let ∆ 1 , ∆ 2 be vertex transitive graphs on m 1 , m 2 vertices, respectively, and let Γ be a product graph Γ " ∆ 1˚∆2 on m 1 m 2 vertices, where˚stands for˝,ˆ, or b. Let ν be an eigenvalue of Γ and pλ i , µ i q for 1 ď i ď k pairs of eigenvalues of ∆ 1 , ∆ 2 respectively so that ν " f pλ i , µ i q for all 1 ď i ď k for the appropriate f . Let L ∆1,λi and L ∆2,µi for each 1 ď i ď k be the corresponding lattices. Then L Γ,ν is the orthogonal projection of Z m1m2 onto the space spanned by where ' is the orthogonal direct sum. In particular, if k " 1 then up to similarity.
Proof. Let V ∆1,λi , W ∆2,µi be the eigenspaces of ∆ 1 , ∆ 2 corresponding to λ i , µ i , respectively, with the corresponding orthogonal projection matrices P ∆1,λi , P ∆2,µi . Then and V ∆1,λi " span R L ∆1,λi , W ∆2,µi " span R L ∆2,µi , so Since adjacency matrices of graphs are symmetric, the eigenspaces corresponding to distinct eigenvalues are orthogonal, so that any two V ∆1,λi are orthogonal to each other, as are any two W ∆2,µi . Then each two V ∆1,λi b R W ∆2,µi are also orthogonal to each other, and the eigenspace of Γ corresponding to ν is by (5), where P Γ,ν is the orthogonal projection matrix onto U Γ,ν ; we are using here the fact that R m1 b R R m2 " R m1m2 . Then L Γ,ν " P Γ,ν Z m1m2 . Now suppose k " 1, then applying (5) again and using the fact that Z m1 b Z Z m2 " Z m1m2 , we have: This completes the proof.
We also discuss a relation between lattices generated by a graph and by its complement. If Γ is a graph on n vertices, then its complement Γ 1 is a graph on the same vertices that has no common edges with Γ and so when 'put together' the two form a complete graph K n . Vertex transitive graphs are regular, so let k be the common degree of the vertices of Γ. Then n´k´1 is the common degree of the vertices of Γ 1 . So k is an eigenvalue of Γ of multiplicity 1 with the corresponding eigenvector 1 :" p1, . . . , 1q J and n´k´1 is an eigenvalue of Γ 1 of the same multiplicity with the same corresponding eigenvector. Moreover the following lemma holds.
Proposition 14. Let Γ be a vertex transitive graph on n vertices of degree k and Γ 1 its complement. Then for each eigenvalue λ ‰ k of Γ there is an eigenvalue λ 1 "´λ´1 of Γ 1 of the same multiplicity and the lattices L Γ,λ and L Γ 1 ,λ 1 are the same.
Proof. It is well known that if ppxq is the characteristic polynomial of the adjacency matrix A of Γ, then the characteristic polynomial of the adjacency matrix B of Γ 1 is qpxq " p´1q n x´n`k`1 x`k`1 pp´x´1q, and so for each eigenvalue λ ‰ k of Γ there is an eigenvalue λ 1 "´λ´1 of Γ 1 of the same multiplicity (see, for instance, p. 27 of [BH12]). Further, the adjacency matrices satisfy the relation where I n is the nˆn identity matrix and J n is the nˆn matrix consisting of all 1's. Let λ ‰ k be an eigenvalue of Γ with a corresponding eigenvector x. Since eigenspaces of Γ corresponding to different eigenvalues are orthogonal, x must be orthogonal to 1, which means that n ÿ i"1 x i " 0, and so J n x " 0. Then Bx " J n x´x´λx " p´λ´1qx, i.e. x is an eigenvector of B corresponding to the eigenvalue λ 1 . This means that the eigenspace of Γ 1 corresponding to the eigenvalue λ 1 "´λ´1 is the same as the eigenspace of Γ corresponding to the eigenvalue λ, hence they generate the same lattices.
We now consider more examples. In all the examples to follow, lattices are specified up to similarity. Information about the graphs we mention can be found, for instance, in [BH12].
Example 2. Recall the construction of the Hamming graph Hpd, qq: if S is a set of q elements and d a positive integer, then vertex set of Hpd, qq is S d , the set of ordered d-tuples of elements of S, and two vertices are connected by an edge if they differ in precisely one coordinate. Hpd, qq has eigenvalues pq´1qd´qi with multiplicity`d i˘p q´1q i for 0 ď i ď d. It is well known that Hpd, qq is the Cartesian product of d complete graphs K q , and hence gives rise to product lattices.
For instance, Hp2, 3q has 9 vertices and three eigenvalues: 4 (multiplicity 1),´2 (multiplicity 4) and 1 (multiplicity 4). Projection matrices of both of the 4-dimensional eigenspaces give rise to the same tensor product lattice: On the other hand, the graph Hp3, 2q has 8 vertices and is isomorphic to the cube graph Q 3 , i.e.
Example 3. Recall the construction of the Kneser graph KG n,k : vertices of this graph correspond to kelement subsets of a set of n elements, and two vertices are connected by an edge if the corresponding sets are disjoint. KG n,k has eigenvalue p´1q j`n´k´j k´j˘o ccurring with multiplicity`n j˘´`n j´1˘f or all j " 1, . . . , k, and therefore gives rise to strongly eutactic lattices in arbitrarily large dimensions.
For instance, Petersen graph (which is the same as the Kneser graph KG 5,2 ) has 10 vertices and three eigenvalues: 3 (multiplicity 1), 1 (multiplicity 5) and´2 (multiplicity) 4. For eigenvalue´2, we obtain the lattice A4 . For eigenvalue 1, we obtain A 2 5 , an example of the Coxeter-Barnes lattice A r n , defined as the lattice contained in the hyperplane H " pe 1`¨¨¨`en`1 q K with the basis # e 1´e2 , . . . , e 1´en , 1 r n`1 ÿ i"2 pe 1´ei q + and defined for all positive rational r. When r is an integer dividing n`1, these are exactly the lattices Λ for which A n Ă Λ Ă An, so that A r n contains A n to index r ([Mar03], Section 5.2). In particular, A 2 5 is the unique sublattice of the dual lattice A5 :" tx P R 5 : x J y P Z for all y P A 5 u, which contains A 5 to index 2. As mentioned above, it can be described as a full rank lattice in the hyperplane # x P R 6 : Here is this description: where e 1 , . . . , e 6 are standard basis vectors in R 6 .
Example 4. The line graph of a graph Γ is the graph Γ 1 whose vertices correspond to edges of Γ, and two vertices are connected by an edge if and only if the corresponding edges in Γ meet in a vertex. For instance, the line graph of the Petersen graph is a vertex transitive graph on 15 vertices. Among its eigenvalues,´1 comes with multiplicity 4 and the corresponding lattice is A4 ,´2 comes with multiplicity 5 and the corresponding lattice is the Coxeter lattice A 3 5 , which can be described as a full rank lattice in the hyperplane # x P R 6 : Here is the description: where e 1 , . . . , e 6 are standard basis vectors in R 6 . It is the unique sublattice of A5 containing A 5 to index 3; it is isometric to the dual of A 2 5 . Example 5. Recall the construction of the Johnson graph Jpn, kq: vertices of this graph correspond to kelement subsets of a set of n elements, and two vertices are connected by an edge if the corresponding sets intersect in k´1 elements. Jpn, kq has`n k˘v ertices and eigenvalue ppk´jqpn´k´jq´jq occurring with multiplicity`n j˘´`n j´1˘f or all j " 1, . . . , mintk, n´ku, and therefore gives rise to strongly eutactic lattices in arbitrarily large dimensions.
It is well known that Johnson graph Jpn, 2q (also known as the triangular graph T n ) is the line graph of the complete graph K n and the complement of the Kneser graph KG n,2 . In particular, Jp5, 2q is the line graph of K 5 and the complement of the Petersen graph. Further, Jpn, 2q is a strongly regular graph, and so always has three eigenvalues: 2pn´2q (multiplicity 1), n´4 (multiplicity n´1),´2 (multiplicity npn´3q{2). We present some examples of lattices from Jpn, 2q in Table 2, which are the same as for its complement KG n,2 . In this table, the lattice L Jpn,2q,´2 for n " 6 is listed as the 9-dimensional lattice sth15 in the online catalog [Mar] of strongly eutactic lattices; for larger n in our table these lattices are not catalogued.

Jpn, 2q
# of vertices Lattice L Jpn,2q,n´4 Lattice L Jpn,2q,´2  Table 2. Examples of strongly eutactic lattices from Johnson Jpn, 2q graphs As we we mentioned above, the Johnson graphs Jpn, 2q are strongly regular, as are their complements Kneser graphs KG n,2 . Recall that a (connected) graph Γ on n vertices is called strongly regular with parameters k, , m whenever it is not complete and: (1) each vertex is adjacent to k vertices, (2) for each pair of adjacent vertices there are vertices adjacent to both, (3) for each pair of non-adjacent vertices there are m vertices adjacent to both. Strongly regular graphs are known to have many remarkable properties. In particular, these are precisely the k-regular graphs with three distinct eigenvalues. One of these eigenvalues is always k (multiplicity 1) with the vector p1, . . . , 1q J being a corresponding eigenvector; the other two eigenvalues are roots of the polynomial x 2´p ´mqx`pm´kq, which are known to be integers when they have different multiplicity. See Chapter 9 of [BH12] for many more details.
Example 6. We mention a few more examples of notable vertex transitive strongly regular graphs giving rise to interesting lattices (these graphs are described, for instance, in [BH12] and in [Bai]). These examples are all connected by the common property of being graphs represented by the roots of the lattice E 8 (along with some others already described above; see Section 3.11 of [BCN89], also Section 14.3 of [DL97]).
The folded 5-cube obtained by identifying the antipodal vertices of the 5-cube is a strongly regular graph on 16 vertices with parameters k " 5, " 0, m " 2. Its complement (also vertex transitive strongly regular) is called the Clebsch graph. They each have an eigenvalue of multiplicity 5 (´3 and 2, respectively), and the corresponding lattice is D5 , the dual of the root lattice D 5 , where the lattice family D n is defined as x P Z n : The Shrikhande graph can be constructed as Cayley graph of the group Z{4ZˆZ{4Z, taking elements for vertices and connecting two vertices by an edge if and only if their difference is in t˘p1, 0q,˘p0, 1q,˘p1, 1qu. This graph is a strongly regular graph on 16 vertices with parameters k " 6, " 2, m " 2. It has an eigenvalue 2 of multiplicity 6, and the corresponding lattice is D6 , which is an example of one of the lattices defined for even n. The complement of the Shrikhande graph (also vertex transitive strongly regular) has eigenvalue´3 with multiplicity 6 and produces the same lattice. The Schläfli graph is the complement of the intersection graph of the 27 lines on a cubic surface. It is a strongly regular graph on 27 vertices with parameters k " 16, " 10, m " 8 and has eigenvalue 4 of multiplicity 6. Its complement (also vertex transitive strongly regular) has eigenvalue´5 with multiplicity 6. Both of these generate the lattice E6 , the dual of the root lattice E 6 . Recall that the lattice E 8 " D8 , the lattice E 7 is the sublattice of E 8 with x 7 " x 8 , and the lattice E 6 is the sublattice of E 8 with x 6 " x 7 " x 8 (see [CS99] for more details).
Finally, the Gosset graph (the only one out of these E 8 -root graphs which is not strongly regular) is a graph on 56 vertices that can be identified with two copies of the set of edges of the complete graph K 8 . Then two vertices from the same copy of K 8 are connected by an edge if they correspond to disjoint edges of K 8 , and two vertices from different copies of K 8 are are connected by an edge if they correspond to edges that meet in a vertex (see [BCN89] for more details). The Gosset graph has eigenvalue 9 of multiplicity 7, generating the lattice E7 , the dual of E 7 .
The main purpose of all these examples is to demonstrate that this construction of strongly eutactic lattices from vertex transitive graphs appears to produce a wide range of interesting examples already in low dimensions, and hence may be quite useful in higher dimensions too where a classification of strongly eutactic lattices is not yet available.
We also observe here an interesting connection between contact polytopes of some lattices and graphs generating them. For a lattice Λ, its contact polytope CpΛq is defined as the convex hull of the set of minimal vectors. The significance of the contact polytope is that its vertices are points on the sphere centered at the origin in the sphere packing associated to Λ at which neighboring spheres touch it. Hence the number of vertices of CpΛq is the kissing number of Λ. The skeleton graph of this polytope skelpCpΛqq is the graph consisting of vertices and edges of CpΛq.
Let us consider an example Λ " E6 . The contact polytope of E6 has 54 vertices, split into 27˘pairs: it is a diplo-Schläfli polytope (see [CS91]). The prefix "diplo" means double: for a polytope Π a diplo-Π polytope is a polytope whose vertices are vertices of Π and its opposite´Π. The Schläfli polytope, with Coxeter symbol 2 21 , has 27 vertices corresponding to the 27 lines on a cubic surface [Cox40]. Its skeleton is the Schläfli graph Γ. By Example 6 above, Γ has an eigenvalue 4 of multiplicity 6, and L Γ,4 " E6 .
Here is another example of this dual correspondence. For Λ " E7 , its contact polytope is the Gosset polytope (also called Hess polytope) 3 21 , which has 56 vertices (see [Gos00], [Cox73]). Its skeleton is the Gosset graph Γ. As we know from Example 6 above, Γ has an eigenvalue 9 of multiplicity 7, and L Γ,9 " E7 . This kind of correspondence certainly does not work for all strongly eutactic lattices. For instance, the contact polytope of An is a diplo-simplex (see [CS91]), and the skeleton graph of a regular simplex on n`1 vertices is the complete graph K n`1 . By Lemma 11, K n`1 generates A n , but not An. On the other hand, the diplo-simplex for A3 is a cube, whose skeleton graph Q 3 is isomorphic to Hp3, 2q and the lattice corresponding to eigenvalue 1 (or´1) is A3 (see Example 2 above). It would be interesting to understand this correspondence better.

On the Coherence of a lattice
We conclude with some remarks on the coherence of lattices and frames and their use in the application of compressed sensing. While this discussion is speculative, we hope it will also draw interesting connections and spark interesting future directions. We start with some definitions. Let L Ă R n be a lattice. As usual, let SpLq be the set of minimal vectors of L, which come in˘pairs, and let us write S˚pLq for the subset of SpLq where only one vector of each pair is included. Then any two vectors x, y P S˚pLq are linearly independent, so the angle θpx, yq between them is in the interval rπ{3, 2π{3s. Define the coherence of L to be CpLq :" maxt| cos θpx, yq| : x ‰ y P S˚pLqu, then 0 ď CpLq ď 1 2 . In fact, we can speculate a little more about CpLq. The packing density of L is where ω n is the volume of a unit ball in R n . Suppose that a lattice L Ă R n has a basis consisting of minimal vectors b 1 . . . b n P SpLq and let B "`b 1 . . . b nb e the corresponding basis matrix, then }b i } " |L| for each i. For each 1 ď i ď n´1, let us write ν i as the angle between b i`1 and the subspace spanned by b 1 , . . . , b i . Then Therefore ω n 2 n δpLq " Now, the larger ś n i"1 | sin ν i | is, the smaller is δpLq, and it is known that if L is a eutactic lattice which is not perfect, then it is a local minimum of δ. Hence it is natural to expect that ś n i"1 | sin ν i | will be large on non-perfect eutactic lattices, meaning that the angles ν 1 , . . . , ν n´1 will be large. This suggests that minimal basis vectors might be closer to orthogonal, and so the coherence of the set of minimal vectors might be expected to be small: in other words, large packing density and small coherence might be opposing goals. We now demonstrate a couple of non-perfect strongly eutactic lattices with coherence ă 1{2, which come out of our construction of lattices from graphs.
Example 7. There are three strongly eutactic lattices in R 3 (up to similarity): Z 3 " L 03,0 , A 3 " L K3,´1 and A3 " L Hp3,2q,1 , out of which A 3 is the only one that is perfect, and hence a local maximum of the packing density function δ on the space of lattices. Then Z 3 and A3 are local minima of δ. Notice that S˚pZ 3 q is an orthogonal basis, while S˚pA 3 q and S˚pA3 q are tight frames of cardinalities 6 and 4, respectively. The lattice A3 can be represented in R 3 as¨1´1 with the set of minimal vectors tp˘1,˘1,˘1qu. Hence the coherence CpA3 q " 1{3. On the other hand, CpA 3 q " 1{2, and no subset of S˚pA 3 q of cardinality 4 has lower coherence. More generally, the lattice Ak represented in R k`1 has S˚pAk q given by (4), i.e. gives a cyclic pk, k`1q-ETF with coherence 1{k discussed in [BFG`16].
Let us also consider the non-perfect strongly eutactic lattice D6 , generated by the Shrikhande graph. It  has 32 minimal vectors of the form  1  2  p˘1,˘1,˘1,˘1,˘1,˘1q with an even number of negative coordinates ( [Mar03], Section 4.4), hence |D6 | " a 3{2 and CpD6 q " 1{3. Thus S˚pD6 q is a tight frame of 16 vectors in R 6 with coherence 1{3: this, again, is an ETF discussed in [BFG`16]. This lattice also has a basis of minimal vectors by Theorem 1.1 of [Mar07].
Three other examples constructed in [BFG`16] we briefly mention are strongly eutactic non-perfect lattices in dimensions 5, 13 and 25, generated by p10, 5q, p26, 13q and p50, 25q ETFs, respectively. In all of these three cases the set of minimal vectors of the resulting lattice consists precisely of˘vectors of the generating frame, and the resulting coherences of these lattices are 1{3, 1{5 and 1{7, respectively. For comparison, the coherence of densest known lattices in dimensions 5 and 13 is 1{2.
It would be interesting to further investigate coherence of eutactic lattices and, more generally, wellrounded lattices: recall that a full-rank lattice in R n is called well-rounded if it has n linearly independent minimal vectors; all eutactic and perfect lattices are well-rounded.
Coherence plays an important role in many applications, and lattice generating ETFs with small coherence are particularly useful. For example, the field of compressed sensing aims to recover a sparse vector from a small number of linear measurements. The applications are abundant, ranging from medical imaging and environmental sensing to radar and communications [FR13,EK12]. Here, we say a vector is s-sparse when it has at most s non-zero entries. Put succinctly, compressed sensing aims to recover an s-sparse vector x P R n from the measurements y " Ax P R k , where A is a suitable kˆn measurement matrix. It is now well known that an s-sparse vector x can be efficiently and robustly recovered from measurements y when the number of measurements k is approximately s log n, yielding a significant reduction in the dimension of the representation from n to s log n (since s is typically much smaller than n). For such techniques, one typically constructs A randomly and/or asks that the matrix has highly incoherent columns; this is equivalent to requiring CpLq to be small in situations when columns of A are minimal vectors of a lattice L. To this end, it is very natural to consider ETFs and other frames with nice algebraic properties as suitable measurement operators [TKK14,FNS19]. Moreover, in many applications, more is known about the signal than simple sparsity; for example, the signal may often also have integer-valued entries or entries in some other lattice. Such is the case for example in wireless communications [RHE14], collaborative filtering [DR16], error correcting codes [CRTV05], and many others. Although there is some preliminary work for this setting [MR11, DT09, Sto10, TNGT09, ZG11, FK18], there is still not a rigorous understanding of when and how the lattice structure of the signal can actually be utilized in reconstruction.
Our work may shed some light on integer-valued sparse recovery by observing the following. If the integer span of an ETF or another suitable frame is a lattice, then viewing this frame as a measurement matrix (whose columns are the frame vectors), its image restricted to integer-valued signals forms a lattice. This allows for separation of such images of sparse signals, analogous to the well-known Johnson-Lindenstrauss lemma, which has been used to guarantee accurate recovery in compressed sensing [BDDW08]. In fact, when the minimal vectors of the lattice contain the frame vectors, this separation can be bounded. Viewed in this context, Theorem 1 gives an answer as to which measurement matrices (given as tight frames) map integervalued signals to elements of a lattice. Studies of properties of such lattices (e.g. Voronoi cell) have the potential to give stronger guarantees in the integer sparse regime for reconstruction. Of course the integer span of vectors is a larger subset than the image of sparse vectors, however it may be interesting future work to specialize these questions to integer vectors that are in particular also sparse. Group frames may also be interesting for further study given the advantage they give due to their compact representation: fixing a group and picking a starting vector, the entire frame can be generated as its orbit under the group action.
To examine how deterministic low-coherence measurement matrices perform in the integer sparse framework we perform a simple experiment using a Steiner ETF of 4000 vectors in R 775 , generated from the incidence matrix of an affine Steiner triple system. A schematic representation of this ETF and its Gram matrix is shown in Figure 2. We chose this measurement matrix for these experiments for a couple of reasons. Steiner ETFs, ETFs generated from a type of combinatorial construction, have been singled out as some of the ETFs with the most potential in application to problems in compressed sensing [FMT12]. These Steiner ETFs stand out because by working in a sufficiently large dimension the coherence can be made arbitrarily  small and the redundancy as large as desired, this property being inherited from known constructions of Hadamard matrices and Steiner triple systems used to generate these incoherent frames [FMT12]. Although these matrices have other undesirable properties such as being sparse themselves, the freedom to generate large matrices with small coherence is instrumental in sparse recovery given the well-studied relation between low-coherence matrices and guarantees in compressed sensing.
Denoting this frame of vectors by F , we acquire the measurements y " F x or the noisy measurements y " F x`e where x is a vector of varying sparsity and e is scaled Gaussian noise. We then use various compressed sensing algorithms to recoverx and calculate how often recovery is exact (x "x) in the noiseless case, and the magnitude of the recovery error (}x´x} 2 ) in the noisy case. We show results for the simple least-squares method (LS) that simply setsx " F : y, basic hard thresholding (HT) which first estimates the support of x via the proxy F T y and then performs least-squares over that support, Orthogonal Matching Pursuit [TG07] (OMP) which is an iterative greedy algorithm, and PrOMP [FK18] which is a modification of OMP for integer-valued signals. The results are shown in Figure 3, where we see unsurprisingly that PrOMP performs quite well in this case, confirming the previous observations of effectiveness of pre-processing steps in lattice-valued compressed sensing. The previous analysis in [FK18] has explained via a concentration of measure argument why this should hold for Gaussian matrices, but numerically there is some evidence that performance improvements hold for deterministic measurements and integer signals in iterative compressed sensing procedures when a pre-processing step, as is found in PrOMP, is applied.