Identifying complex Hadamard submatrices of the Fourier matrices via primitive sets

From MaRDI portal
Publication:2656643

DOI10.1016/J.LAA.2021.01.017zbMATH Open1460.15036arXiv1909.13145OpenAlexW2975319550MaRDI QIDQ2656643FDOQ2656643


Authors: John E. Herr, Troy M. Wiegand Edit this on Wikidata


Publication date: 16 March 2021

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1909.13145




Recommendations




Cites Work


Cited In (3)





This page was built for publication: Identifying complex Hadamard submatrices of the Fourier matrices via primitive sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656643)