Identifying complex Hadamard submatrices of the Fourier matrices via primitive sets
From MaRDI portal
Publication:2656643
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1215293 (Why is no real title available?)
- A Concise Guide to Complex Hadamard Matrices
- Complex Hadamard matrices and the spectral set conjecture
- Dense analytic subspaces in fractal \(L^2\)-spaces
- Fuglede's conjecture is false in 5 and higher dimensions
- Hadamard triples generate self-affine spectral measures
- On the existence of complex Hadamard submatrices of the Fourier matrices
- On the universal tiling conjecture in dimension one
- Permutation equivalence classes of Kronecker products of unitary Fourier matrices
- Tiling the integers with translates of one finite set
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)