Primality Testing via Circulant Matrix Eigenvalue Structure: A Novel Approach Using Cyclotomic Field Theory
- URL: http://arxiv.org/abs/2505.00730v1
- Date: Mon, 28 Apr 2025 17:46:57 GMT
- Title: Primality Testing via Circulant Matrix Eigenvalue Structure: A Novel Approach Using Cyclotomic Field Theory
- Authors: Marius-Constantin Dinu,
- Abstract summary: This paper presents a novel primality test based on the eigenvalue structure of circulant matrices constructed from roots of unity.<n>We prove that integer $n > 2$ is prime if and only if a minimal validation of the matrix of $C_n = W_n + W_n2$ has exactly two irreducible factors.
- Score: 2.0547410497538445
- License: http://creativecommons.org/licenses/by/4.0/
- 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 $n > 2$ is prime if and only if the minimal polynomial of the circulant matrix $C_n = W_n + W_n^2$ has exactly two irreducible factors over $\mathbb{Q}$. 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 analyze the computational complexity of our method in comparison with established primality tests. The visual interpretation of our mathematical framework provides intuitive understanding of the algebraic structures that distinguish prime numbers. Our experimental validation demonstrates that our approach offers a deterministic alternative to existing methods, with performance characteristics reflecting its algebraic foundations.
Related papers
- Alpay Algebra: A Universal Structural Foundation [0.0]
Alpay Algebra is introduced as a universal, category-theoretic framework.<n>It unifies classical algebraic structures with modern needs in symbolic recursion and explainable AI.
arXiv Detail & Related papers (2025-05-21T10:18:49Z) - The moment polytope of matrix multiplication is not maximal [3.1593341358400737]
We prove separations between the moment polytopes of matrix multiplication tensors and unit tensors.<n>As a consequence, we find that matrix multiplication moment polytopes are not maximal.<n>We extend these techniques to obtain a new proof of the optimal border subrank bound for matrix multiplication.
arXiv Detail & Related papers (2025-03-28T17:25:06Z) - Irreducible matrix representations for the walled Brauer algebra [0.9374652839580183]
This paper investigates the representation theory of the algebra of partially transposed permutation operators, $mathcalAd_p,p$.<n>It provides a matrix representation for the abstract walled Brauer algebra.<n>This algebra has recently gained significant attention due to its relevance in quantum information theory.
arXiv Detail & Related papers (2025-01-22T18:22:20Z) - Understanding Matrix Function Normalizations in Covariance Pooling through the Lens of Riemannian Geometry [63.694184882697435]
Global Covariance Pooling (GCP) has been demonstrated to improve the performance of Deep Neural Networks (DNNs) by exploiting second-order statistics of high-level representations.<n>This paper provides a comprehensive and unified understanding of the matrix logarithm and power from a Riemannian geometry perspective.
arXiv Detail & Related papers (2024-07-15T07:11:44Z) - Entrywise error bounds for low-rank approximations of kernel matrices [55.524284152242096]
We derive entrywise error bounds for low-rank approximations of kernel matrices obtained using the truncated eigen-decomposition.
A key technical innovation is a delocalisation result for the eigenvectors of the kernel matrix corresponding to small eigenvalues.
We validate our theory with an empirical study of a collection of synthetic and real-world datasets.
arXiv Detail & Related papers (2024-05-23T12:26:25Z) - Mathematical Foundations for a Compositional Account of the Bayesian
Brain [0.0]
We use the tools of contemporary applied category theory to supply functorial semantics for approximate inference.
We define fibrations of statistical games and classify various problems of statistical inference as corresponding sections.
We construct functors which explain the compositional structure of predictive coding neural circuits under the free energy principle.
arXiv Detail & Related papers (2022-12-23T18:58:17Z) - Multiparameter Persistent Homology-Generic Structures and Quantum
Computing [0.0]
This article is an application of commutative algebra to the study of persistent homology in topological data analysis.
The generic structure of such resolutions and the classifying spaces are studied using results spanning several decades of research.
arXiv Detail & Related papers (2022-10-20T17:30:20Z) - Agnostic Online Learning and Excellent Sets [18.557423328068122]
We show that $epsilon$-excellent sets exist for any $epsilon frac12$ in $k$-edge stable graphs in the sense of model theory.<n>We also give a version of the dynamic Sauer-Shelah-Perles lemma appropriate to this setting, related to definability of types.
arXiv Detail & Related papers (2021-08-12T07:33:33Z) - Learning Algebraic Recombination for Compositional Generalization [71.78771157219428]
We propose LeAR, an end-to-end neural model to learn algebraic recombination for compositional generalization.
Key insight is to model the semantic parsing task as a homomorphism between a latent syntactic algebra and a semantic algebra.
Experiments on two realistic and comprehensive compositional generalization demonstrate the effectiveness of our model.
arXiv Detail & Related papers (2021-07-14T07:23:46Z) - Abelian Neural Networks [48.52497085313911]
We first construct a neural network architecture for Abelian group operations and derive a universal approximation property.
We extend it to Abelian semigroup operations using the characterization of associative symmetrics.
We train our models over fixed word embeddings and demonstrate improved performance over the original word2vec.
arXiv Detail & Related papers (2021-02-24T11:52:21Z) - Finite-Function-Encoding Quantum States [52.77024349608834]
We introduce finite-function-encoding (FFE) states which encode arbitrary $d$-valued logic functions.
We investigate some of their structural properties.
arXiv Detail & Related papers (2020-12-01T13:53:23Z) - Positive maps and trace polynomials from the symmetric group [0.0]
We develop a method to obtain operator inequalities and identities in several variables.
We give connections to concepts in quantum information theory and invariant theory.
arXiv Detail & Related papers (2020-02-28T17:43:37Z) - A refinement of Reznick's Positivstellensatz with applications to
quantum information theory [72.8349503901712]
In Hilbert's 17th problem Artin showed that any positive definite in several variables can be written as the quotient of two sums of squares.
Reznick showed that the denominator in Artin's result can always be chosen as an $N$-th power of the squared norm of the variables.
arXiv Detail & Related papers (2019-09-04T11:46:26Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.