Primes as Phase-Maximizing Cycle Lengths in Combinatorial Dynamics

Read full text Summarise with VIRAT
Authors: Nathan Hamaoui
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

We introduce a dynamical characterization of prime numbers: a natural number p is prime if and only if there exists a recursive composition rule on ℤ_p generating exactly p distinct phases in faithful cyclic orbit before closure. This recasts primality as optimal phase space exploration in discrete recursive systems—composites collapse to proper sub-cycles, losing interference complexity. Generalizing ℤ_4 recursive propagators that produce Gaussian kernels, we prove the phase richness criterion ρ(N)=1 ⇔ N prime and verify computationally to 10^4, revealing primes as structural atoms of coherent path summation in combinatorial dynamics.

Fields of Study & Subjects

Analytic Number Theory Research Advanced Mathematical Theories and Applications Smarandache Functions and Recreational Number Theory

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
25 March 2026
Language
EN
Document type
Preprint