A numerical study on the regularity of \(d\)-primes via informational entropy and visibility algorithms
From MaRDI portal
Publication:2205952
DOI10.1155/2020/1480890zbMath1445.11094OpenAlexW3083916065MaRDI QIDQ2205952
B. L. Mayer, Luiz H. A. Monteiro
Publication date: 21 October 2020
Published in: Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/1480890
Cites Work
- Unnamed Item
- Unnamed Item
- Social interaction and the city: the effect of space on the reduction of entropy
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- Biological models: measuring variability with classical and quantum information
- New quantum structure of space-time
- DETECTING SERIES PERIODICITY WITH HORIZONTAL VISIBILITY GRAPHS
- From time series to complex networks: The visibility graph
- Small gaps between prime numbers: The work of Goldston-Pintz-Yildirim
- The Riemann Zeros and Eigenvalue Asymptotics
- Elementary methods in the study of the distribution of prime numbers
- Complex and Adaptive Dynamical Systems
- Small differences between prime numbers
This page was built for publication: A numerical study on the regularity of \(d\)-primes via informational entropy and visibility algorithms