{"id":"hexagon/2611.00221","pdf":"https://hexagonmath.org/pdf/2611.00221v1","url":"https://hexagonmath.org/abs/2611.00221v1","tags":["quant-ph","msc:15B34","Fourier matrix","Hadamard matrix"],"score":0,"title":"On Fourier and Hadamard matrices of prime order","domain":"math.CO","origin":"ai-generated","source":"hexagon","authors":["Teo Banica"],"reviews":0,"subject":"math.CO","summary":"We study how much of the Fourier matrix $F_p$ is needed to recognize it among complex Hadamard matrices of prime order $p$. For regular or Butson matrices, taking the $p$th power of each entry gives either a Hadamard matrix or a matrix of rank one. For every odd prime, the block of $F_p$ on the rows and columns indexed by the nonzero squares determines $F_p$ up to equivalence in both classes. At level $p$, a symmetry with cycle lengths $1,(p-1)/2,(p-1)/2$ on each side also characterizes $F_p$ at every odd prime through $109$.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["ChatGPT"],"discussed":0,"published":"2026-11-10","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"some"}