当前位置: X-MOL 学术Complexity › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A Numerical Study on the Regularity of -Primes via Informational Entropy and Visibility Algorithms
Complexity ( IF 1.7 ) Pub Date : 2020-09-10 , DOI: 10.1155/2020/1480890
B. L. Mayer 1 , L. H. A. Monteiro 1, 2
Affiliation  

Let a -prime be a positive integer number with divisors. From this definition, the usual prime numbers correspond to the particular case . Here, the seemingly random sequence of gaps between consecutive -primes is numerically investigated. First, the variability of the gap sequences for is evaluated by calculating the informational entropy. Then, these sequences are mapped into graphs by employing two visibility algorithms. Computer simulations reveal that the degree distribution of most of these graphs follows a power law. Conjectures on how some topological features of these graphs depend on are proposed.

中文翻译:

信息熵和能见度算法对素数规律性的数值研究

-素数为带除数的正整数。根据此定义,通常的质数对应于特定情况在这里,连续的之间的间隙的看似随机序列-素数进行数值分析。首先,缺口序列的可变性通过计算信息熵来评估。然后,通过使用两种可见性算法将这些序列映射为图形。计算机仿真表明,大多数这些图的度分布遵循幂定律。提出了关于这些图的某些拓扑特征如何依赖的猜想
更新日期:2020-09-10
down
wechat
bug