Primality Testing via Circulant Matrix Eigenvalue Structure: A Novel Approach Using Cyclotomic Field Theory
Marius-Constantin Dinu

TL;DR
This paper introduces a new deterministic primality test based on the eigenvalue structure of circulant matrices derived from roots of unity, connecting cyclotomic field theory with matrix algebra for practical primality verification.
Contribution
It establishes a novel primality criterion using minimal polynomial factorization of circulant matrices, integrating cyclotomic fields and eigenvalue analysis for the first time.
Findings
Eigenvalue patterns distinguish primes from composites
The method provides a deterministic primality test
Experimental validation shows competitive performance
Abstract
This paper presents a novel primality test based on the eigenvalue structure of circulant matrices constructed from roots of unity. We prove that an integer is prime if and only if the minimal polynomial of the circulant matrix has exactly two irreducible factors over . This characterization connects cyclotomic field theory with matrix algebra, providing both theoretical insights and practical applications. We demonstrate that the eigenvalue patterns of these matrices reveal fundamental distinctions between prime and composite numbers, leading to a deterministic primality test. Our approach leverages the relationship between primitive roots of unity, Galois theory, and the factorization of cyclotomic polynomials. We provide comprehensive experimental validation across various ranges of integers, discuss practical implementation considerations, and…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms
