Related papers: A Small World Network of Prime Numbers
Let $q, n, m \in \mathbb{N}$ such that $q$ is a prime power, $m \geq 3$ and $a \in \mathbb{F}$. We establish a sufficient condition for the existence of a primitive normal pair ($\alpha$, $f(\alpha)$) in $\mathbb{F}_{q^m}$ over…
We show that all natural numbers $n\equiv 4\pmod 6$ are the sum of two Chen primes (primes $p$ such that $p+2$ has at most two prime factors), apart from a power-saving set of exceptions. This improves on various previous results and is…
In this article, we propose a growing network model based on an optimal policy involving both topological and geographical measures. In this model, at each time step, a new node, having randomly assigned coordinates in a $1 \times 1$…
A graph is split if there is a partition of its vertex set into a clique and an independent set. The present paper is devoted to the splitness of some graphs related to finite simple groups, namely, prime graphs and solvable graphs, and…
A quantum internet holds promise for achieving distributed quantum sensing and large-scale quantum computer networks, as well as quantum communication among arbitrary clients all over the globe. The main building block is efficient…
In the present work we demonstrate that the so called Goldbach conjecture from 1742, All positive even numbers greater than two can be expressed as a sum of two primes, due to Leonhard Euler, is a true statement. This result is partially…
An positive even number is said to be a Kronecker number if it can be written in infinitely many ways as the difference between two primes, and it is believed that all even numbers are Kronecker numbers. We will study the division and…
Let $n$ be a natural number greater than $2$ and $q$ be the smallest prime dividing $n$. We show that a finite subset $A$ of rationals, of cardinality at most $q$, contains a $n^{th}$ power in $\mathbb{Q}_{p}$ for almost every prime $p$ if…
Let $p_n$ be $n$th prime, and let $(S_n)_{n=1}^\infty:=(S_n)$ be the sequence of the sums of the first $2n$ consecutive primes, that is, $S_n=\sum_{k=1}^{2n}p_k$ with $n=1,2,\ldots$. Heuristic arguments supported by the corresponding…
We prove that assuming the Generalized Riemann Hypothesis every even integer larger than $\exp(\exp(15.85))$ can be written as the sum of a prime number and a number that has at most two prime factors.
We analyze a distributed information network in which each node has access to the information contained in a limited set of nodes (its neighborhood) at a given time. A collective computation is carried out in which each node calculates a…
Watts and Strogatz [Nature 393, 440 (1998)] have recently introduced a model for disordered networks and reported that, even for very small values of the disorder $p$ in the links, the network behaves as a small-world. Here, we test the…
After a failure or attack the structure of a complex network changes due to node removal. Here, we show that the degree distribution of the distorted network, under any node disturbances, can be easily computed through a simple formula.…
We construct equilibrium networks by introducing an energy function depending on the degree of each node as well as the product of neighboring degrees. With this topological energy function, networks constitute a canonical ensemble, which…
In this short paper, following the most recent advances in complex network theory, a new approach to number theory with potential applications to other fields is proposed. The model by Garcia-Perez, Serrano and Boguna, introduces an…
In this work we use the number classification in families of the form 6n+1, and 6n+5 with n integer (Such families contain all odd prime numbers greater than 3 and other compound numbers related with primes). We will use this kind of…
Let $G$ be a finite group, and let $\Delta(G)$ be the prime graph built on its set of conjugacy class sizes: this is the (simple undirected) graph whose vertices are the prime numbers dividing some conjugacy class size of $G$, and two…
Discoveries of the scale-free and small-world features are reported on a network constructed from the seismic data. It is shown that the connectivity distribution decays as a power law, and the value of the degrees of separation, i.e., the…
The Landau-Selberg-Delange method provides an asymptotic formula for the partial sums of a multiplicative function whose average value on primes is a fixed complex number $v$. The shape of this asymptotic implies that $f$ can get very small…
In recent years there has been considerable interest in the structure and dynamics of complex networks. One of the most studied networks is the linear Barab\'asi-Albert model. Here we investigate the nonlinear Barab\'asi-Albert growing…