A Prime-Indexed Logarithmic Spiral Geometric Graph via the Golden Angle

We introduce the Prime Spiral Geometric Graph (PSGG), a geometric construction in which each prime pi generates a regular pi-gon whose center lies on a logarithmic spiral with angular step equal to the Golden Angle ω ≈ 137.508◦ . The full vertex set for the first N = 137 primes has cardinality |V | = 48,494; endowing it with a k-nearest-neighbour edge set yields a dense geometric graph G = (V, E). We prove that the number of vertices inside a disk of radius R satisfies |V (R)| ∼ k 2 2 log2φ (log R) 2 log log R (R → ∞), a consequence of the classical prime-sum asymptotics of Landau (1909) and Massias–Robin (1996). Computationally, G splits into 129 components for k = 6 nearest neighbours and becomes connected for k ≥ 10. We place the construction in the context of prior work (Ulam spiral, Sacks spiral, phyllotaxis models, polygonal spiral sequences), identify the dual role of each prime as both spiral index and polygon vertex count as the novel element, and list seven open problems connecting the PSGG to spectral graph theory, algebraic topology, and the distribution of prime gap

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-05-02
DOI
https://doi.org/10.5281/zenodo.19979328
Citations
2
Primary Topic
Algebraic Geometry and Number Theory
Type
article
Field-Weighted Citation Impact
118.92
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Prime-Indexed Logarithmic Spiral Geometric Graph via the Golden Angle

Zydre Stoniene
2 citations
Zenodo (CERN European Organization for Nuclear Research)
Algebraic Geometry and Number Theory
118.92
article

A Prime-Indexed Logarithmic Spiral Geometric Graph via the Golden Angle

Zydre Stoniene
article en
2 citations

Abstract

We introduce the Prime Spiral Geometric Graph (PSGG), a geometric construction in which each prime pi generates a regular pi-gon whose center lies on a logarithmic spiral with angular step equal to the Golden Angle ω ≈ 137.508◦ . The full vertex set for the first N = 137 primes has cardinality |V | = 48,494; endowing it with a k-nearest-neighbour edge set yields a dense geometric graph G = (V, E). We prove that the number of vertices inside a disk of radius R satisfies |V (R)| ∼ k 2 2 log2φ (log R) 2 log log R (R → ∞), a consequence of the classical prime-sum asymptotics of Landau (1909) and Massias–Robin (1996). Computationally, G splits into 129 components for k = 6 nearest neighbours and becomes connected for k ≥ 10. We place the construction in the context of prior work (Ulam spiral, Sacks spiral, phyllotaxis models, polygonal spiral sequences), identify the dual role of each prime as both spiral index and polygon vertex count as the novel element, and list seven open problems connecting the PSGG to spectral graph theory, algebraic topology, and the distribution of prime gap

Zenodo (CERN European Organization for Nuclear Research)
Sustainable cities and communities
Openalex Percentile: Top 0%
Algebraic Geometry and Number Theory
118.92
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Prime-Indexed Logarithmic Spiral Geometric Graph via the Golden Angle — Zydre Stoniene · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS