Cyclic p-roots of prime lengths p and related complex Hadamard matrices
Uffe Haagerup

TL;DR
This paper proves that for every prime p, the set of cyclic p-roots in complex space is finite and provides an exact count, impacting the understanding of complex Hadamard matrices of prime size.
Contribution
It establishes the finiteness of cyclic p-roots for prime p and derives an explicit formula for their number, advancing the classification of complex circulant Hadamard matrices.
Findings
Number of cyclic p-roots is (2p-2)!/(p-1)!^2
Finite set of cyclic p-roots for prime p
Upper bound on complex circulant Hadamard matrices
Abstract
In this paper it is proved, that for every prime number p, the set of cyclic p-roots in C^p is finite. Moreover the number of cyclic p-roots counted with multiplicity is equal to (2p-2)!/(p-1)!^2. In particular, the number of complex circulant Hadamard matrices of size p, with diagonal entries equal to 1, is less or equal to (2p-2)!/(p-1)!^2.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Advanced Topics in Algebra · Finite Group Theory Research
