Permutation equivalence classes of Kronecker products of unitary Fourier matrices (Q855564): Difference between revisions

The author presents a nice classification of Kronecker products of unitary Fourier matrices. Two square matrices \(A\), \(B\) of same size are called permutation equivalent, if there exist permutation matrices \(P\), \(Q\) such that \(A=PBQ\). Let \({\mathcal F}_N\) be the set of all square matrices of size \(N\) which are Kronecker products of unitary Fourier matrices. Then \({\mathcal F}_N\) is split into permutation equivalence classes. The number of equivalence classes within \({\mathcal F}_N\), where \(N\) has the prime factorization \(N=a_1^{b_1}a_2^{b_2}\,\ldots\,a_r^{b_r}\) \((a_1>a_2>\,\ldots\,>a_r)\) is equal to \(p(b_1)\,p(b_2)\,\ldots\,p(b_r)\), where \(p(n)\) is the number of partitions of \(n\in {\mathbb N}\). A partition of \(n\) is given by \(\{n_1,\,n_2,\,\ldots,\,n_s\}\), where \(n_1+n_2+\,\ldots\,+n_s=n\) and \(n_1\geq n_2\geq\,\ldots\,\geq n_s >0\).