Exploring topological features of a complex network of prime factors and composite numbers
Abstract
Prime numbers are mathematical concepts of particular interest because of their relative rarity among integers, as well as the relative unpredictability of their occurrence and density along the integer sequence. They constitute the building blocks of all other composite numbers, giving rise to the interesting and important concept of prime factorization, a process guaranteed by the fundamental theorem of arithmetic. Among the several works that have been reported about prime numbers and their interrelationship with composite numbers, some have considered derived graphs and/or networks. In this paper, we derive some topological features of a bipartite complex network of prime factors and composite numbers. More specifically, we prove mathematically that the network's diameter is exactly five regardless of the number of nodes. In particular, we show that certain nontrivial sub-networks have minimal diameter equal to four, which is, again, independent of the number of nodes as long as the network is large enough. The last shows that this network is of small-world type. We also characterize exactly the number of boundary nodes in the network and present a couple of algorithms to identify the most important, relevant, influential, or central nodes of the network. Finally, we focus on the computation of the information dimensions on the basis of Shannon and Tsallis entropies of the studied complex network. The results show both decreasing as the number of nodes increases. Furthermore, both entropies indicate that box coverings at the diameters ε=[3,4], group nodes into roughly the same number of boxes, independent of the number of nodes in the network.
Related
- The topological Ax--Lindemann theorem for the complex hyperbolic space
- Topological defect trains excited by a boundary discontinuity in the two-dimensional complex Ginzburg-Landau equation
- A practical framework for exploring non-linear dose–response using adherence data in complex interventions
- Superselection Rigidity of Topological Calderbank--Shor--Steane Codes: From Koszul-Complex Models to Nonsplit Extensions
- Domain-decomposed Evolutional Deep Neural Network with Random Features for Transient Pressure Diffusion with Discontinuous and High-Contrast Coefficients
BibTeX
@misc{tamayocastro2026exploring,
title = {{Exploring topological features of a complex network of prime factors and composite numbers}},
author = {Carlos Daniel Tamayo-Castro and Aldo Ramirez-Arellano and Juan Bory-Reyes},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.33873},
eprint = {2610.33873},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.33873},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Exploring topological features of a complex network of prime factors and composite numbers
AU - Carlos Daniel Tamayo-Castro
AU - Aldo Ramirez-Arellano
AU - Juan Bory-Reyes
PY - 2026
DA - 2026/10/24
PB - arXiv
DO - 10.48550/arxiv.2610.33873
UR - https://arxiv.org/abs/2610.33873
AB - Prime numbers are mathematical concepts of particular interest because of their relative rarity among integers, as well as the relative unpredictability of their occurrence and density along the integer sequence. They constitute the building blocks of all other composite numbers, giving rise to the interesting and important concept of prime factorization, a process guaranteed by the fundamental theorem of arithmetic. Among the several works that have been reported about prime numbers and their interrelationship with composite numbers, some have considered derived graphs and/or networks. In this paper, we derive some topological features of a bipartite complex network of prime factors and composite numbers. More specifically, we prove mathematically that the network's diameter is exactly five regardless of the number of nodes. In particular, we show that certain nontrivial sub-networks have minimal diameter equal to four, which is, again, independent of the number of nodes as long as the network is large enough. The last shows that this network is of small-world type. We also characterize exactly the number of boundary nodes in the network and present a couple of algorithms to identify the most important, relevant, influential, or central nodes of the network. Finally, we focus on the computation of the information dimensions on the basis of Shannon and Tsallis entropies of the studied complex network. The results show both decreasing as the number of nodes increases. Furthermore, both entropies indicate that box coverings at the diameters ε=[3,4], group nodes into roughly the same number of boxes, independent of the number of nodes in the network.
ER -