Dihedral Group Frames with the Haar Property
Vignon Oussa, Brian Sheehan

TL;DR
This paper proves that for odd integers n, the orbit of almost every vector under a specific dihedral group representation forms a basis for ^n, establishing the Haar property and providing explicit conditions.
Contribution
It demonstrates that for odd n, almost all vectors have orbits with the Haar property under the dihedral group representation, fully resolving a previously partial problem.
Findings
Almost every vector's orbit has the Haar property for odd n.
Explicit conditions are given for vectors with the Haar property.
The Haar property holds if and only if n is odd.
Abstract
We consider a unitary representation of the Dihedral group obtained by inducing the trivial character from the co-normal subgroup This representation is naturally realized as acting on the vector space We prove that the orbit of almost every vector in with respect to the Lebesgue measure has the Haar property (every subset of cardinality of the orbit is a basis for ) if is an odd integer. Moreover, we provide explicit sufficient conditions for vectors in whose orbits have the Haar property. Finally, we derive that the orbit of almost every vector in under the action of the representation has the Haar property if and only if is odd. This completely settles a problem which was only partially answered in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Dihedral Group Frames with the Haar Property
Vignon Oussa, Brian Sheehan
Dept. of Mathematics
Bridgewater State University
Bridgewater, MA 02324 U.S.A.
Abstract.
We consider a unitary representation of the Dihedral group obtained by inducing the trivial character from the co-normal subgroup This representation is naturally realized as acting on the vector space We prove that the orbit of almost every vector in with respect to the Lebesgue measure has the Haar property (every subset of cardinality of the orbit is a basis for ) if is an odd integer. Moreover, we provide explicit sufficient conditions for vectors in whose orbits have the Haar property. Finally, we derive that the orbit of almost every vector in under the action of the representation has the Haar property if and only if is odd. This completely settles a problem which was only partially answered in [7].
Key words and phrases:
Linearly independent frames, Haar property
2000 Mathematics Subject Classification:
15A15,42C15
1. Introduction
Let be a set of vectors in an -dimensional vector space over We say that has the Haar property or is a full spark frame if any subset of of cardinality is a basis for . We recall that a set of vectors contained in is called a frame for [3] if is a spanning set for the vector space Moreover, it is well-known that a countable family of vectors is a frame for if and only if there exist positive constants such that
[TABLE]
for every vector Let
[TABLE]
be the synthesis operator corresponding to . The adjoint of also known as the analysis operator is defined as follows
[TABLE]
The composition of the synthesis operator with its adjoint
[TABLE]
is called the frame operator. It is a well-known fact [3] that if is a frame then is a self-adjoint invertible operator and every vector can be represented as
[TABLE]
In other words, any vector can be reconstructed from the sequence In fact if is a proper subset of such that is also a frame then any vector can be reconstructed from the sequence . Thus, full spark frames are very flexible basis-like tools in the sense that if is a full spark frame, then for any subset of of cardinality every vector can be uniquely represented as
[TABLE]
We shall now present some examples of full spark frames induced from the action of group representations. Let be the Heisenberg group which is a finite group generated by
[TABLE]
It is shown in [6, 8] that for almost every vector (with respect to Lebesgue measure) the collection
[TABLE]
is a full spark frame. Next, let be a natural number greater than two. Let be the Dihedral group generated by where
[TABLE]
It is proved in [7] that if is even then it is not possible to find a full spark frame of the type Moreover, if is prime then there exists a Zariski open subset of such that is a full spark frame for every vector in While this result establishes the existence of vectors such that has the Haar property when is prime, the work in [7] is not constructive. Moreover, the case where is odd but not prime was left open in [7]. The main objective of the present paper is to fill this gap by settling the following. Let be an odd number which is not necessarily odd.
- •
Is there a vector such that has the Haar property?
- •
Can we provide an explicit construction of a vector such that has the Haar property?
1.1. Main results
Here is a summary of our results. For a fixed natural number , we define such that
[TABLE]
Theorem 1**.**
If is odd and then is a full spark frame.
Suppose now that is a finite group of matrices of order acting on Moreover, let us assume that the order of is greater than or equal to It is not hard to verify that if there exists one vector in such that the orbit of under the action of has the Haar property then for almost every vector (with respect to Lebesgue measure) in the orbit of under the action of has the Haar property. Indeed, assume that there exists a vector in such that has the Haar property. Consider the matrix-valued function
[TABLE]
By assumption, there exists an element in the range of the function above such that any sub-matrix of order of has a non-zero determinant. Let be the set of all sub-matrices of of order Next, let be the least common multiple of all polynomials obtained by computing the determinant of where That is,
[TABLE]
Clearly is not a zero for the polynomial Next, let be an open set around such that does not contain zero. Since is continuous, the inverse image of the open set under the map is an open subset of So, there exists an open subset of containing which is disjoint from the zero set of This implies that is not the zero polynomial. Since the zero set of is a co-null set with respect to the Lebesgue measure on , it immediately follows that for almost every vector in the set has the Haar property. From the preceding discussion, the following is immediate.
Corollary 2**.**
Let be an odd natural number greater than two. There exists a Zariski open subset such that if then is a full spark frame.
Finally, a direct application of the results in [7] and Theorem 1 together with Corollary 2 gives the following.
Corollary 3**.**
The -orbit of almost every vector (with respect to the Lebesgue measure) in is a full spark frame if and only if is odd.
The paper is organized as follows. In the second section, we fix notation and we review a variety of relevant concepts. The third section contains intermediate results leading to the proof of the main result which is given in the last section.
2. Preliminaries
Let us start by fixing notation. Given a matrix the transpose of is denoted The determinant of a matrix is denoted by or The -th row of is denoted and similarly, the -th column of the matrix is denoted Let be a group acting on a set We denote this action multiplicatively. For any fixed element the -orbit of is described as
2.1. Fourier Analysis on
Let Let be the vector space of all complex-valued functions on endowed with the dot product
[TABLE]
The norm of a given vector in is computed as follows We recall that the discrete Fourier transform is a map defined by
[TABLE]
The following facts are also well-known [10].
- •
The discrete Fourier transform is a bijective linear operator.
- •
The Fourier inverse of a vector is given by
[TABLE]
- •
The Fourier transform is a unitary operator. More precisely, given we have
The followig is proved in [4].
Lemma 4**.**
Let be the matrix representation of the Fourier transform. If is prime then every minor of is nonzero.
Identifying with via the map v\mapsto\left[\begin{array}[c]{ccc}v\left(0\right)&\cdots&v\left(n-1\right)\end{array}\right]^{T}, we may write
[TABLE]
It is not hard to verify that for any we have and Next, let be the matrix representation of the Fourier transform with respect to the canonical basis of The matrix is diagonalizable and its Jordan canonical form is obtained by conjugating by the discrete Fourier matrix. More precisely if then the diagonal entry of is given by Finally, it is worth noting that commutes with the Fourier matrix
2.2. Determinants
([5], Section ) Let be a square matrix of order A minor of is the determinant of any square sub-matrix of Let be an -rowed minor of The determinant of the sub-matrix obtained by deleting from the rows and columns represented in is called the complement of and is denoted Let be the -rowed minor of in which rows and columns are represented. Then the algebraic complement, or cofactor of is given by According to Laplace’s Expansion Theorem (see [5]) a formula for the determinant of can be obtained as follows. Let be the set of all ordered sets of cardinality of the type Given any two elements and in we define to be the sub-matrix of of order such that According to Laplace’s Expansion Theorem, once we fix an ordered set in the determinant of can be computed via the following expansion
[TABLE]
The following well-known result will also be useful to us.
Lemma 5**.**
(Page [5]) Let
[TABLE]
be a Vandermonde matrix. Then
[TABLE]
3. Intermediate Results
In this section, we will prove several results which lead to the proof of Theorem 1. Put
[TABLE]
Let is be the inverse of modulo That is Let be the linear operator obtained by conjugating by the Fourier transform. Let be the group of linear operators generated by and Fixing an ordering for the elements of , we may write We identify the Hilbert space in the usual way with the Cartesian product of copies of the complex plane. For any we define the map where is the by matrix-valued function whose row corresponds to the vector which is an element of the -orbit of From our definition, is regarded as a matrix-valued function taking the vector to the matrix
[TABLE]
Let be a fixed submatrix of of order Fixing an ordering for the rows of , we may assume that the following holds true.
**Case : **
Either
[TABLE]
or
[TABLE]
**Case : **
or is equal to
[TABLE]
for some integers such that if then and if then
Let be the non-trivial polynomial defined by
[TABLE]
3.1. Case
Let us consider the complex curve
[TABLE]
The image of this curve under the function is simply computed by replacing each variable by If we assume that is equal to the first matrix described in Case then
[TABLE]
In a similar fashion, it is easy to verify that if is equal to the second matrix described in Case then
[TABLE]
Thus, the determinants of the matrices described in Case (a) are non-zero polynomials.
3.2. Case
Define matrices as
[TABLE]
respectively. Additionally, we define and as
[TABLE]
respectively. Note that is a square matrix of order is a square matrix of order and are matrices of order and respectively. If we assume that is as described in Case then is given in block form as follows
[TABLE]
Lemma 6**.**
The following holds true.
- (1)
** 2. (2)
**
Proof.
The multi-linearity of the determinant function together with Formula (2.2) give the desired result. ∎
Let be an ordered subset of of cardinality and set
[TABLE]
Let be the matrix given in (3.8). To avoid cluster of notation, from now on, we shall write Put
[TABLE]
For such that and define
[TABLE]
Lemma 7**.**
The product of the determinants of and is equal to the non-trivial polynomial
Proof.
We check that the determinant of the matrix is a monomial in the variable which is given by
[TABLE]
Moreover, the determinant of is given by
[TABLE]
In summary, taking the product of (3.11) and (3.12) we obtain Moreover, since and for and , it must be case that the monomial is a non-trivial polynomial. ∎
Observe that and and are subsets of of the same cardinality. Furthermore if and are not equal as sets, we shall write and
[TABLE]
such that each is a positive number belonging to the set , and We recall that is the matrix obtained by selecting all entries of the matrix of the type where is in and is an element of
Lemma 8**.**
If is odd then
[TABLE]
Proof.
According to Lemma 7, if then
[TABLE]
For the other way around, let us suppose that Then First, we observe that, there exists integer and a complex number such that
[TABLE]
Secondly, the monomial can be computed by multiplying
[TABLE]
by a suitable rational function of the variable . Indeed, since the set is obtained by taking the union of and \mathbf{p}_{m}-$$\mathbf{i}_{m}, the above-mentioned monomial is the product of and where
[TABLE]
Next, it is clear that for some integer and is computed as follows. If zero is an element of then
[TABLE]
Next,
[TABLE]
Since is odd, the integer cannot be equal to zero. On the other hand, if zero is not an element of then
[TABLE]
In this case, since each is positive, must be a non-trivial homogeneous polynomial in the variable It follows that
[TABLE]
and is a not equal to zero. Thus,
[TABLE]
∎
Lemma 9**.**
The following holds true.
- (1)
Every submatrix of order of is a non-vanishing element of the ring 2. (2)
Every submatrix of order of is a non-vanishing element of the ring of degree less than or equal to
Proof.
For the first part, let be a submatrix of of order . Assume that is given as shown in (3.8). Let
[TABLE]
We fix Put According to Laplace’s Expansion Theorem,
[TABLE]
Next,
[TABLE]
where
[TABLE]
From our previous discussion, the monomial appears once in the expansion above. Moreover, since is never equal to zero, it follows that the determinant of is a non-vanishing polynomial in the variable For the second part, it is clear that the degree of the polynomial satisfies the following condition
[TABLE]
Next, since the determinant of any sub-matrix of order of must be a sum of polynomials of degree less or equal to then the second part of the lemma holds. ∎
4. Proof of Theorem 1
First, observe that . Fix where is as described in (1.2). Since the determinant of every submatrix of of order is a polynomial in of degree bounded above by it is clear that the determinant of every submatrix of of order cannot be equal to zero. As such, it immediately follows that is a set of cardinality in which is a full spark frame. Consequently, since it follows that
[TABLE]
is a set of cardinality in enjoying the Haar property.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. C, Aitken Determinants and Matrices, Oliver and Boyd, Ltd., Edinburgh (1939).
- 2[2] B. Alexeev, J. Cahill, D. G. Mixon, Full spark frames, preprint (2011)
- 3[3] P. Casazza, J. Kovacevi, Equal-Norm Tight Frames with Erasures, Adv. Comput. Math. 18(2-4), 387–430 (2003).
- 4[4] R.J. Evans, I.M. Isaacs, Generalized Vandermonde Determinants and Roots of Unity of Prime Order, Proc. Amer. Math. Soc. 58, 51–54 (1976).
- 5[5] E. Howard Elementary matrix theory, Reprint of the 1966 edition. Dover Books on Advanced Mathematics. Dover Publications, Inc., New York, 1980.
- 6[6] R. D. Malikiosis, A note on Gabor frames in finite dimensions, Appl. Comput. Harmon. Anal. 38(2), 318330 (2015).
- 7[7] V. Oussa, Dihedral Group Frames which are Maximally Robust to Erasures, Linear and Multilinear Algebra, Volume 63, Issue 12, 2015
- 8[8] J. Lawrence, G. Pfander, D. Walnut, Linear Independence of Gabor Systems in Finite Dimensional Vector Spaces, J. Fourier Anal. Appl., 11(6), 715–726 (2005).
