Polybrutus 13D: Exact Conservative Euclidean Completion and a Sevenfold Weighted-Graph Mode

Independently reproducible exact computation of a labelled 18-point Euclidean distance configuration with minimal affine rank 13. All 136 labelled squared distances from the preceding Polybrutus 12D (DOI 10.5281/zenodo.24408720) are preserved exactly, without moving any old vertex. One new orthogonal radius-R vector adds 17 new distances with square 2R², giving 153 labelled pairs organized in eight exact normalized families. The coordinate-difference rank equals 13, and the centered distance Gram matrix has exact rank 13 and a symbolic positive-semidefinite factorization. Two separately implemented programs verify all 153 squared distances; four deliberate invalid cases are rejected. For a chosen theoretical complete weighted-graph scalar oscillator model with unit masses and couplings w_ij=R²/d_ij², the exact 18-by-18 Laplacian characteristic polynomial is chi18(z)=z(z-9)^7(z-17/2)^4 f6(z-11/2), where f6(z)=chiP7(z)/z. Thus eigenvalue 9 has exact multiplicity seven and eigenvalue 17/2 has exact multiplicity four. The complete symbolic determinant and an independent rational-metric characteristic polynomial confirm both results. These are mathematical model values, not experimentally observed frequencies or physical new dimensions. The orthogonal metric-extension method and uniform graph spectral shift are established mathematics. No novel universal theorem, fundamental physics finding, special 13R/base-13 connection or independent human peer review is claimed. Frozen reproducible source release: Topbrutus/polybrutus-d13, tag v0.1.0, immutable scientific source commit 4d5f10de586e6677ddbe1d90b18218b46602d14e. Three published attachments: Git-tag source ZIP, full PDF scientific note, and JSON table of all 153 exact labelled squared distances. Research code MIT, scientific note CC BY 4.0. Generative AI disclosure: OpenAI ChatGPT (Astra) substantially assisted exact symbolic calculations, independent rational verifier programming, ideal oscillator graph-spectral analysis, provenance auditing, source code, documentation, preparation and drafting of the preprint. Gabriel St-Pierre originated and directs the Polybrutus research and is responsible for the deposited scientific work. The AI is not an author. Independent human peer review remains pending.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-21
DOI
https://doi.org/10.5281/zenodo.24408768
Primary Topic
Graph theory and applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Polybrutus 13D: Exact Conservative Euclidean Completion and a Sevenfold Weighted-Graph Mode

Gabriel St‐Pierre
20 links
Zenodo (CERN European Organization for Nuclear Research)
Graph theory and applications
preprint

Polybrutus 13D: Exact Conservative Euclidean Completion and a Sevenfold Weighted-Graph Mode

Gabriel St‐Pierre
preprint en

Abstract

Independently reproducible exact computation of a labelled 18-point Euclidean distance configuration with minimal affine rank 13. All 136 labelled squared distances from the preceding Polybrutus 12D (DOI 10.5281/zenodo.24408720) are preserved exactly, without moving any old vertex. One new orthogonal radius-R vector adds 17 new distances with square 2R², giving 153 labelled pairs organized in eight exact normalized families. The coordinate-difference rank equals 13, and the centered distance Gram matrix has exact rank 13 and a symbolic positive-semidefinite factorization. Two separately implemented programs verify all 153 squared distances; four deliberate invalid cases are rejected. For a chosen theoretical complete weighted-graph scalar oscillator model with unit masses and couplings w_ij=R²/d_ij², the exact 18-by-18 Laplacian characteristic polynomial is chi18(z)=z(z-9)^7(z-17/2)^4 f6(z-11/2), where f6(z)=chiP7(z)/z. Thus eigenvalue 9 has exact multiplicity seven and eigenvalue 17/2 has exact multiplicity four. The complete symbolic determinant and an independent rational-metric characteristic polynomial confirm both results. These are mathematical model values, not experimentally observed frequencies or physical new dimensions. The orthogonal metric-extension method and uniform graph spectral shift are established mathematics. No novel universal theorem, fundamental physics finding, special 13R/base-13 connection or independent human peer review is claimed. Frozen reproducible source release: Topbrutus/polybrutus-d13, tag v0.1.0, immutable scientific source commit 4d5f10de586e6677ddbe1d90b18218b46602d14e. Three published attachments: Git-tag source ZIP, full PDF scientific note, and JSON table of all 153 exact labelled squared distances. Research code MIT, scientific note CC BY 4.0. Generative AI disclosure: OpenAI ChatGPT (Astra) substantially assisted exact symbolic calculations, independent rational verifier programming, ideal oscillator graph-spectral analysis, provenance auditing, source code, documentation, preparation and drafting of the preprint. Gabriel St-Pierre originated and directs the Polybrutus research and is responsible for the deposited scientific work. The AI is not an author. Independent human peer review remains pending.

Zenodo (CERN European Organization for Nuclear Research)
Graph theory and applications
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.

Laika access coming soon
Polybrutus 13D: Exact Conservative Euclidean Completion and a Sevenfold Weighted-Graph Mode — Gabriel St‐Pierre · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS