On Fourier and Hadamard matrices of prime order
Source: hexagonmath.org/abs/2611.00221v1
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$.
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00221
curl -X POST /api/v1/records/hexagon/2611.00221/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00221/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'