New Constructions of Group-Invariant Butson Hadamard Matrices
Tai Do Duc

TL;DR
This paper introduces three new methods for constructing group-invariant Butson Hadamard matrices, including the first non-abelian case and two cases involving finite local rings, expanding the known classes of such matrices.
Contribution
It presents the first known constructions of $ ext{BH}(G,h)$ matrices with non-abelian groups and introduces two new families based on finite local rings.
Findings
First known family of $ ext{BH}(G,h)$ with non-abelian $G$
Two new families of $ ext{BH}(G,h)$ with finite local rings
Expands the existence and construction methods for group-invariant Butson Hadamard matrices
Abstract
Let be a finite group and let be a positive integer. A matrix is a -invariant matrix whose entries are complex th roots of unity such that , where denotes the complex conjugate transpose of , and is the identity matrix of order . In this paper, we give three new constructions of matrices. The first construction is the first known family of matrices in which does not need to be abelian. The second and the third constructions are two families of matrices in which is a finite local ring.
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.
Taxonomy
Topicsgraph theory and CDMA systems · Advanced Topics in Algebra · Mathematics and Applications
New Constructions of Group-Invariant
Butson Hadamard Matrices
Tai Do Duc
Division of Mathematical Sciences
School of Physical & Mathematical Sciences
Nanyang Technological University
Singapore 637371
Republic of Singapore
Abstract
Let be a finite group and let be a positive integer. A matrix is a -invariant matrix whose entries are complex th roots of unity such that , where denotes the complex conjugate transpose of , and denotes the identity matrix of order . In this paper, we give three new constructions of matrices. The first construction is the first known family of matrices in which does not need to be abelian. The second and the third constructions are two families of matrices in which is a finite local ring.
1 Introduction
Let and be positive integers. An -matrix whose entries are complex th roots of unity is called a Butson Hadamard matrix if , where is the complex conjugate transpose of and is the identity matrix of order . We say that is a matrix. The focus of this paper is Butson Hadamard matrices which are invariant under the action of finite groups. Let be a finite group. A matrix is -invariant if for all . A -invariant matrix is called a matrix. The topic of group-invariant Butson Hadamard matrices encompasses many combinatorial objects such as generalized Hadamard matrices, generalized Bent functions, abelian splitting semi-regular relative difference sets, cyclic -roots, perfect sequences and perfect arrays, see [14] and [6] for more details.
Let denote the least common multiple of the orders of the elements of . Let denote the -adic valuation of the integer . Using bilinear forms over finite abelian groups, we [5, Theorem 2.1] constructed matrices in which is a finite abelian group and
- (i)
for every prime divisor of , and
- (ii)
if is odd and has a direct factor .
The conditions (i) and (ii) are also necessary conditions for the existence of matrices in the case is a cyclic group of prime-power order, see [5, Theorem 3.6]. Furthermore, [5, Theorem 2.1] is the state-of-the-art class of group-invariant Butson Hamard matrices which includes previously known constructions in [1] and [10].
In the case is a cyclic group, most known necessary conditions, see [6], on the existence of matrices involve a condition on . However when is not a cyclic group, the situation turns out to be different. As the last two constructions in this paper suggest, the conditions required for these constructions to work are the existence of various vanishing sums of roots of unity.
In this paper, we construct three new classes of matrices. Our first construction is a class of matrices which does not require to be abelian, but requires to contain a large enough normal cyclic subgroup. The second and the third constructions use ideas in the studies of relative difference sets in finite local rings by Leung et. al. [11, 12].
To end this section, we state the following result by Lam and Leung [9] on the existence of vanishing sums of roots of unity.
Result 1.1**.**
Let and be positive integers and let be the prime factorization of . If are th roots of unity such that , then .
2 Preliminaries
2.1 Group-invariant Butson Hadamard matrices and group-ring equations
As it turns out, the properties of group-invariant Butson Hadamard matrices can be wrapped in a single group-ring equation. The theory of group rings and characters is pivotal in our study.
Let be a finite group, let be a number ring and let denote the group ring of over . The elements of have the form with . The numbers are called coefficients of . Two elements and in are equal if and only if for all . A subset of is identified with the group ring element . For the identity element of and , we write for the group ring element .
For , we denote a primitive th root of unity by . In our study, we focus on the ring . For , we write
[TABLE]
where denotes the complex conjugate of .
If is an abelian group, then we can study the ring using characters of . We denote the group of complex characters of by . The trivial character of , denoted by , is defined by for all . For and , we set . The following result is the well known Fourier inversion formula for group ring theory and a proof can be found in [2, Ch. VI, Lem. 3.5].
Result 2.1** (Fourier inversion).**
Let be a finite abelian group and let . Then
[TABLE]
for all . Consequently, if and for all , then .
The following result [5, Lemma 3.3] translates the properties of a matrix into an equation in . We include a proof for the convenience of the reader.
Result 2.2**.**
Let be a finite group, let be a positive integer, and let , , be complex th roots of unity. Consider the element of and the matrix , , given by . Then is a matrix if and only if
[TABLE]
Proof.
It is clear that the matrix defined by is -invariant, as for any . Let be arbitrary. The coefficient of in is
[TABLE]
On the other hand, let and be any two elements in . Write , . The inner product of row and row of is
[TABLE]
Therefore, the equation (1) holds if and only if any two distinct rows of have inner product [math], that is, if and only if is a matrix. ∎
2.2 Our construction approach
By Result 2.2, the existence of a matrix is equivalent to the existence of a group ring element with the following properties.
- (i)
Each is an th root of unity.
- (ii)
.
In our constructions, we imply a structure on by putting , where
- (a)
(note that we usually choose as subgroups, or cosets of a subgroup, of );
- (b)
Each is a complex th root of unity.
Assume that we have with and satisfying conditions (a) and (b). We proceed to finding conditions for and such that (i) and (ii) are satisfied. Note that each belongs to for some nonempty subset of , so we need , where is an th root of unity. This results in various vanishing sums of roots of unity whose existence is determined by Result 1.1. The difficulty now lies in finding such that . An example where this happens is the folowing case: is a finite abelian group such that for any character of , we have
[TABLE]
Assuming this case, we obtain for any . So for any , which implies by Result 2.1.
The idea above will be used in our first and second constructions. The third construction utilizes a similar idea with some modification.
3 Matrices with non-abelian
The main idea in the construction of this section comes from modifying the building set idea used in the study of relative difference sets, see [4] for more details about building sets.
For positive integers and , we denote the cyclic group of order by and a primitive th root of unity by . The following lemma is the main ingredient for our construction.
Lemma 3.1**.**
Let be a positive integer and let be the smallest positive integer such that
[TABLE]
Define
[TABLE]
Then there exists a set of group-ring elements , , which has the following properties.
- (a)
, where each is a complex root of unity.
- (b)
* for any and .*
To prove Lemma 3.1, we need the following result on square norms of algebraic integers. The first part of this result is a familiar property of quadratic Gauss sums. We include proofs for both parts for the convenience of the reader.
Lemma 3.2**.**
Let be an odd positive integer and let be an integer.
- (a)
If has form , then
[TABLE]
- (b)
If has form , then
[TABLE]
Proof.
(a) We have
[TABLE]
As is odd, we have for any . Hence .
(b) For , write with and . We obtain
[TABLE]
Put and . Then
[TABLE]
By part (a), we have
[TABLE]
Moreover, we have
[TABLE]
Consequently, we have . Combining with (4) and (5), we obtain
[TABLE]
∎
Proof of Lemma 3.1.
By Result 2.1, the property (b) of Lemma 3.1 is equivalent to saying that for any character of , we have for exactly one and for this value of .
Let be a generator of . Note that the group of characters of is , where each is defined by for any . Let be a fixed positive integer which is coprime to . There are three cases concerning the parity of and whether .
Case 1. is even.
In this case, we have and . For each , define
[TABLE]
As is the smallest positive integer with the property (2), we have . Hence, the number is odd. Let be any character of . Assume for some . We have
[TABLE]
Note that . Write with and . We obtain
[TABLE]
Hence
[TABLE]
As , there is only one with . Thus, there is only one such that . Moreover by Lemma 3.2.(a), the sum has square norm equal to . We obtain
[TABLE]
Case 2. is odd and .
In this case, we have and . For each , define
[TABLE]
As is the smallest positive integer with the property (2), we have . Note that the group-ring elements are well defined, as . Moreover, the number is odd. Let be any character of . Assume for some . We have
[TABLE]
Note that . Write with and . We obtain
[TABLE]
Hence
[TABLE]
There is only one with , so there is only one such that . Moreover by Lemma 3.2.(b), the sum has square norm equal to . We obtain
[TABLE]
Case 3. .
In this case, we have and . For each , define
[TABLE]
By (2), we have . Hence, the number is odd. Let be any character of . Assume for some . We have
[TABLE]
Note that . Write with and . We obtain
[TABLE]
Hence
[TABLE]
There is only one which satisfies , so there is only one such that . Moreover by Lemma 3.2.(b), the sum has square norm equal to . We obtain
[TABLE]
∎
Theorem 3.3**.**
Let and positive integers with the property
[TABLE]
Define the positive divisor of as follows.
[TABLE]
Suppose that is a group of order which contains as a normal subgroup. Then a matrix exists.
Proof.
Note that a matrix is automatically a matrix whenever , as a th root of unity is a power of a root of unity. Thus, we can assume that is the smallest positive integer with the property ( ‣ 3.3). Let be defined as in Lemma 3.1. Let be a full set of coset representatives of in . Define
[TABLE]
Note that . So . Any element has a unique expression with and . Hence the coefficient of in is , an th root of unity by Lemma 3.1.(a). By Result 2.2, to show that gives a matrix, it remains to verify that . We have
[TABLE]
where the second equality follows from the fact that and is a normal subgroup of . By Lemma 3.1.(b), we have whenever . Hence
[TABLE]
∎
4 Construction in Finite Local Rings
In this section, we adopt the notations and properties of finite local rings used by Leung and Ma [11]. A ring is called a finite local ring if it contains a finite number of elements and it has a unique maximal ideal. Our goal in this section is to construct two classes of matrices, where is some positive integer. The following result [11, Propositions 2.3, 2.4] guarantees the existence of a finite local ring and describes its basic properties.
Result 4.1**.**
Let be positive integers. Then for any prime , there exists a finite local ring of order with the following properties.
- (i)
Its maximal ideal is generated by a prime element ;
- (ii)
* and , where is a unit in ;*
- (iii)
* is a finite field of order ;*
- (iv)
Write , , . The group is isomorphic to .
From now on, we fix the local ring with parameters as above. We note that any nontrivial ideal of has the form for some . Moreover for any . Next, we look at character groups of and .
Let be an additive character of which is nontrivial on . For each , define the map by for all . It is straightforward to check that is an additive character of . Moreover for any , we have if and only if . As is an ideal of and is nontrivial on , we have , which implies . Therefore, the group of characters of is .
Let be any character of . As is a character on , there exists a unique such that for any . Similarly, there exists a unique such that for any . For any , we have
[TABLE]
Therefore, each character of has the form , , with being defined by for any . As the character group of has size , this group is .
4.1 Construction 1
Note that each element can be written uniquely as for some positive integer and a unit in . The following result [11, Section 4] partitions in a way which becomes the main ingredient for our construction in this subsection.
Result 4.2**.**
Let be defined by . Let be a positive integer and let be a partition of such that for any coset of in and any , we have . By we denote the characteristic function of , that is, if and otherwise. For each , define
[TABLE]
Then is a partition of and for any character of , we have
[TABLE]
where the element depends only on .
Theorem 4.3**.**
Let be a finite local ring defined as in Result 4.1. Let be a positive integer and let be the prime factorization of . Assume that
[TABLE]
Then a matrix exists.
Proof.
By (9) and Result 1.1, there exists a vanishing sum of roots of unity of length . In fact, these roots of unity can be used directly in our construction for matrices. However, we will prove this theorem under a more flexible condition as follows. Assume that is any integer such that . By Result 1.1, there exists th roots of unity such that
[TABLE]
We show that these can be used to construct a matrix. Let , , be subsets of defined as in (7). Define
[TABLE]
By Result 4.2, the set is a partition of . Let and assume for some . As does not belong to any with , the coefficient of in is , an th root of unity. Thus all coefficients in are complex th roots of unity. To show that gives a matrix, it remains, by Result 2.2, to show that .
Let denote the trivial character of . By (8), we have
[TABLE]
where the last equality follows from (10). Note that is a partition of and is the characteristic function of . So there exists such that and for any . We obtain , which implies .
Let be any nontrivial character of . By (8), we have
[TABLE]
Similar to the previous case, there exists such that and for any . We obtain , which implies .
Therefore, we have for any character of . As is an abelian group, we obtain, by Result 2.1,
[TABLE]
∎
Remark 4.4**.**
The construction in Theorem 4.3 depends on the relation , where are all prime divisors of . In general, there are many cases where this can happen. For example, if , then we can write for some , see [13, Ex. 4, p.22], which implies . Specifically, consider the case . We have and and for any prime and positive integer . Hence and a matrix exists.
4.2 Construction 2
For each and , define
[TABLE]
Note that both and are subgroups of and each has order . Recall that by Result 2.2, the existence of a matrix is equivalent to the existence of a group-ring element which has coefficients as th roots of unity and satisfies . In our coming construction, we put , where and are th roots of unity and satisfy certain conditions.
Recall that is the generator of the maximal ideal of . For any , we can write it uniquely in the form , where is a unit in and . Define by .
First, observe the following properties of the subgroups and of .
Lemma 4.5**.**
The sets and have the following properties.
- (a)
For any , we have
[TABLE]
- (b)
* for any and .*
- (c)
Let be an element in and put . Then
[TABLE]
Let be an element in and put . Then
[TABLE]
Proof.
(a) If , there exists such that . Hence . On the other hand, if , there exists such that . Hence .
(b) Assume that is an element in for some . By part (a), we have , a contradiction. Thus .
(c) Assume that is an element in . We obtain , which implies , where . Hence . The remaining claim is proved in the same way. ∎
Let be a fixed set of coset representatives of in such that contains [math]. Define . For , define
[TABLE]
Hence is a set of coset representatives of in . Moreover, the set , , is a set of coset representatives of in . Note that and for any . We are ready for the main result of this subsection.
Theorem 4.6**.**
Let , , , , with , , , , be complex th roots of unity such that for any and , we have
[TABLE]
Put
[TABLE]
Then has coefficients as complex th roots of unity and
[TABLE]
As a consequence, there exists a matrix.
Proof.
First, we prove that has all coefficients as complex th roots of unity. Let be any nonzero element in . Comparing the values of and , we consider the following two cases.
Case 1. .
Write and for some . Note that , as . By (a) and (b) of Lemma 4.5, we have . By Lemma 4.5.(c), we have if and only if . If , then is the only set which contains and the coefficient of in is . Assume that . By equation (11), the coefficient of in is
[TABLE]
where such that .
Case 2. .
Write and with some . Note that . By (a) and (b) of Lemma 4.5, we have . By Lemma 4.5.(c), we have if and only if . If , then is the unique set which contains and the coefficient of in is . Assume that . By equation (12), the coefficient of in is
[TABLE]
where such that .
We have shown that any nonzero element has coefficient in as an th root of unity. Now we consider the coefficient of in .
Case 3. .
As and for any , , its coefficient in is . By (11), we have . By (12), we have . By (13), we obtain
[TABLE]
proving that the coefficient of in is an th root of unity.
It remains to show that , which is equivalent to showing for any character of . Recall that the group of characters of is . Each character is defined by , where is a fixed character of which is nontrivial on . The proof of for any follows from the following claims.
Claim 1. .
We have . Hence
[TABLE]
From now one, we fix .
Claim 2. There exists or such that or , respectively. Moreover, the two equations and cannot happen simultaneously.
If for some , then for all , which implies
[TABLE]
If for some , then for all , which implies
[TABLE]
The equation (14) has a solution if and only if . The equation (15) has a solution if and only if . Thus in any case, only one of the two equations (14) or (15) has solution.
Claim 3. .
First, we assume that . Write , . By the proof of Claim 2, there exists an element such that . We also have
[TABLE]
For any , we have and
[TABLE]
where in the last equality, we use the property that is a nontrivial character of . Similarly, for any , we have and
[TABLE]
Combining (16), (17) and (18), we obtain . If , then If , then where such that . In any case, we obtain
Lastly, the case follows similarly from the last case as follows. Put , . Fix such that , that is, . We have
[TABLE]
For any , we have , and for any , we have . We obtain
[TABLE]
If , then . If , then , where such that . In any case, we obtain .
We finish the proof of Claim 3 and finish the proof of Theorem 4.6. ∎
Remark 4.7**.**
The construction of matrices in Theorem 4.6 depends on the existence of complex th roots of unity , , , which satisfy equations (11), (12) and (13). In general, there can be various choices for these roots of unity.
For example, assume that . Note that (11), (12) and (13) are equations of vanishing sums of th roots of unity of various lengths. By Result 1.1, a vanishing sum of th roots of unity of length exists if and only if , where ’s are all prime divisors of . As any integer can be written in the form for some , we have , which implies the existence of a vanishing sum of th roots of unity of length . Hence there exist complex th roots of unity , , , which satisfy (11), (12) and (13).
4.3 A new family of perfect arrays
A multi-dimensional array of size is called a perfect -phase array if all its entries are complex th roots of unity and
[TABLE]
whenever , where the indices are taken modulo for . Perfect arrays have a wide range of applications in communication and radar systems, see [3], [7], [8] for example.
In [6, Lemma 3.4], the author shows the following equivalence between perfect arrays and group-invariant Butson Hadamard matrices.
Result 4.8**.**
Let be positive integers. Then a perfect -phase array of size exists if and only if a matrix exists.
Using Result 4.8 and the construction of group-invariant Butson Hadamard matrices in [5], the author [6] obtained the following array.
Result 4.9**.**
Suppose that are positive integers such that
[TABLE]
Then a perfect -phase array of size exists.
In Theorem 4.3 and Theorem 4.6, we constructed matrices in which is a finite local ring with additive group structure . Hence the corresponding perfect arrays can be constructed directly using Result 4.8.
The construction of matrices in Theorem 4.3 and Theorem 4.6 depends on either following conditions.
- (i)
, where are all prime divisors of .
- (ii)
There exists complex roots of unity , , , , with , , , , such that for any and , we have
[TABLE]
Theorem 4.10**.**
Under the same notations as before, assume that either condition (i) or (ii) is satisfied. Then there exists a perfect -phase array of size , where there are terms and terms .
We note that in the case , both conditions (i) and (ii) are satisfied, as discussed in Remark 4.4 and Remark 4.7. We have the following corollary.
Corollary 4.11**.**
Let and be nonnegative integers. Let and be positive integers such that . Let be a prime. Then there exists a perfect -phase array of size , where there are terms and terms .
Acknowledgment. The author is grateful to Bernhard Schmidt for countless discussions and encouragement throughout this project. The second local-ring construction in this paper is inspired by his work on matrices.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. Backelin: Square Multiples n 𝑛 n Give Infinite Many Cyclic n 𝑛 n -roots. Reports, Matematiska Institutionen, Stockholms Universitet , 8 (1989), 1 – 2.
- 2[2] T. Beth, D. Jungnickel, H. Lenz: Design Theory (2nd edition), Cambridge University Press 1999.
- 3[3] L. Bomer, M. Antweiler: Perfect N-phase sequences and arrays [spread spectrum communication], IEEE J. Selected Areas Commun. 10 (1992), 782 – 789.
- 4[4] J. A. Davis, J. Jedwab: A unifying construction for difference sets. J. Combin. Theory Ser. A 80 (1997), 13 – 78.
- 5[5] T. Do Duc, B. Schmidt: Bilinear Forms on Finite Abelian Groups and Group-Invariant Butson Hadamard Matrices. J. Comb. Theory Ser. A . 166 (2019), 337 – 351.
- 6[6] T. Do Duc: Necessary conditions for the existence of group-invariant Butson Hadamard matrices and a new family of perfect arrays. Des. Codes Cryptogr. (2019). https://doi.org/10.1007/s 10623-019-00671-4
- 7[7] P. Z. Fan, M. Darnell: Sequence Design for Communications Applications . Hoboken, NJ, USA: Wiley, 1996.
- 8[8] S. W. Golomb, G. Gong: Signal Design for Good Correlation: For Wireless Communication, Cryptography and Radar . New York, NY, USA: Cambridge Univ. Press, 2005.
