Related papers: Prime Sums
We investigate geometric properties of surfaces given by certain formulae. In particular, we calculate the singular curvature and the limiting normal curvature of such surfaces along the set of singular points consisting of singular points…
A few formulas and theorems for statistical structures are proved. They deal with various curvatures as well as with metric properties of the cubic form or its covariant derivative. Some of them generalize formulas and theorems known in the…
We present a comparative experimental study of planar curves arising from a Fourier series whose frequencies are the prime numbers, together with several randomized control models. Starting from the series $F_n(t)=\sum_{p\le n} v_p(n!)\,…
We study the relation between the growth rate of a graph property and the entropy of the graph limits that arise from graphs with that property. In particular, for hereditary classes we obtain a new description of the colouring number,…
Large graphs abound in machine learning, data mining, and several related areas. A useful step towards analyzing such graphs is that of obtaining certain summary statistics - e.g., or the expected length of a shortest path between two…
A few elementary estimates of a basic character sum over the prime numbers are derived here. These estimates are nontrivial for character sums modulo large q. In addition, an omega result for character sums over the primes is also included.
We use prime coalgebras as a generalization of simple coalgebras, and observe that prime subcoalgebras represent the structure of the coalgebra in a more efficient way than simple coalgebras. In particular, in this work we focus our…
This note provides an introduction to selected topics in algebraic graph theory, including strongly regular graphs, Steiner systems, and automorphism groups. We describe constructions and properties of notable graphs such as the Petersen…
The vertices of a $k$-token graph of a graph $G$ correspond to $k$ indistinguishable tokens placed on $k$ different vertices of $G$. Changing some conditions on both the nature of the tokens and the number of tokens allowed in each vertex…
Prime number related fractal polygons and curves are derived by combining two different aspects. One is an approximation of the prime counting function build on an additive function. The other are prime number indexed basis entities taken…
A graph is a data structure composed of dots (i.e. vertices) and lines (i.e. edges). The dots and lines of a graph can be organized into intricate arrangements. The ability for a graph to denote objects and their relationships to one…
This is a survey paper. We study the Ricci curvature and spectrum of graphs, as well as the exterior forms and deRahm cohomology on graphs.
Prime Numbers clearly accumulate on defined spiral graphs,which run through the Square Root Spiral. These spiral graphs can be assigned to different spiral-systems, in which all spiral-graphs have the same direction of rotation and the same…
Graphs can have different properties that lead to several graph types and may allow for a varying representation of diverse information. In order to clarify the modeling power of graphs, we introduce a partial order on the most common graph…
Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…
The $k$-coprime graph of order $n$ is the graph with vertex set $\{k, k+1, \ldots, k+n-1\}$ in which two vertices are adjacent if and only if they are coprime. We characterize Hamiltonian $k$-coprime graphs. As a particular case, two…
Directed acyclic graphs whose nodes are all the divisors of a positive integer $n$ and arcs $(a,b)$ defined by $a$ divides $b$ are considered. Fourteen graph invariants such as order, size, and the number of paths are investigated for two…
We investigate the behaviour of a certain additive function depending on prime divisors of specific integers lying in large gaps between consecutive primes. The result is obtained by a combination of results and ideas related to large gaps…
Evidence of an algebraic/analytic structure of the Riemann Spectrum, consisting of the imaginary parts of the corresponding zeros, is reviewed, with emphasis on the distribution of the image of the primes under the Cramer characters…
This is an introduction to graph theory, from a geometric and analytic viewpoint. A finite graph $X$ is described by its adjacency matrix $d\in M_N(0,1)$, which can be thought of as being a kind of discrete Laplacian, and we first discuss…