利用本原集识别Fourier矩阵的复Hadamard子矩阵
Identifying Complex Hadamard Submatrices of the Fourier Matrices via Primitive Sets
摘要:
对于一个给定的选择的行和列的傅立叶矩阵,我们给出了一些测试是否产生的子矩阵是阿达玛的基础上的原始集的行和列。特别是,我们证明,是否一个给定的选择的行和列的傅立叶矩阵的形式阿达玛子矩阵是完全由这些行和列的原始集是否是兼容的傅立叶矩阵的大小。这允许将所有子矩阵划分为完全由Hadamard或完全由非Hadamard子矩阵组成的等价类,并激励创建表示这种结构的兼容性图。我们得出结论,这些图的子矩阵大小为2和3的建设,促进了一些结果。
英文摘要:
For a given selection of rows and columns from a Fourier matrix, we give a number of tests for whether the resulting submatrix is Hadamard based on the primitive sets of those rows and columns. In particular, we demonstrate that whether a given selection of rows and columns of a Fourier matrix forms a Hadamard submatrix is exactly determined by whether the primitive sets of those rows and columns are compatible with respect to the size of the Fourier matrix. This allows the partitioning of all submatrices into equivalence classes that will consist entirely of Hadamard or entirely of non-Hadamard submatrices and motivates the creation of compatibility graphs that represent this structure. We conclude with some results that facilitate the construction of these graphs for submatrix sizes 2 and 3.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。