Polybrutus 17D: Exact Euclidean Completion and an Elevenfold Weighted-Graph Mode

Exact and independently reproducible Euclidean distance-geometry case study of 22 labelled points with minimum affine embedding dimension 17, conservatively extending the published Polybrutus 16D (DOI 10.5281/zenodo.24408979). Every one of 210 predecessor pairwise squared distances remains unchanged, and a new orthogonal unit-radius point adds 21 squared distances equal to 2R², for 231 labelled pair distances in eight exact normalized classes and total squared-distance sum 1895R²/4. The coordinate-difference rank and centered Euclidean distance Gram rank are both exactly 17, with an explicit positive-semidefinite Gram factorization. Two separately implemented exact symbolic/rational programs verify all 231 labelled distances, the 210 parent values and the minimal affine rank; four negative controls detect deliberately invalid variants. For a chosen theoretical complete weighted-graph scalar-oscillator model with equal unit masses and couplings w_ij=R²/d_ij², the full exact 22-by-22 Laplacian characteristic polynomial factors as chi22(z)=z(z-11)^11(z-21/2)^4 f6(z-15/2), where f6(z)=chiP7(z)/z for the canonical seven-vertex graph. The eigenvalue 11 has multiplicity exactly eleven and the eigenvalue 21/2 has multiplicity exactly four. Both root multiplicities are verified by a separately constructed rational-metric graph and exact characteristic-polynomial derivatives. They are abstract mathematical model eigenvalues, not measured frequencies. Orthogonal Euclidean completions and uniform graph-vertex joins are established mathematical techniques; no new universal theorem, new physical spacetime dimension, particle discovery or experimental resonance is claimed. Independent human peer review has not occurred. Frozen science source: Topbrutus/[email protected], commit 1ef37f156292aa80f8c3f5d07bb889dc4b4492ab. Three deposited files: fixed Git-tag source ZIP (MIT software), scientific preprint PDF (CC BY 4.0) and exact JSON certificate listing all 231 labelled squared distances. Generative AI disclosure: OpenAI ChatGPT (Astra) substantially assisted exact symbolic and rational verification software, source auditing, mathematical distance-geometry and the chosen graph spectrum, the manuscript, technical documentation and publication operations. Gabriel St-Pierre originated and directs the Polybrutus research programme and is scientifically responsible for the deposit. The AI system is not an author. No independent human peer review has yet been performed.

Authors

Publication Details

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

Polybrutus 17D: Exact Euclidean Completion and an Elevenfold Weighted-Graph Mode

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

Polybrutus 17D: Exact Euclidean Completion and an Elevenfold Weighted-Graph Mode

Gabriel St‐Pierre
preprint en

Abstract

Exact and independently reproducible Euclidean distance-geometry case study of 22 labelled points with minimum affine embedding dimension 17, conservatively extending the published Polybrutus 16D (DOI 10.5281/zenodo.24408979). Every one of 210 predecessor pairwise squared distances remains unchanged, and a new orthogonal unit-radius point adds 21 squared distances equal to 2R², for 231 labelled pair distances in eight exact normalized classes and total squared-distance sum 1895R²/4. The coordinate-difference rank and centered Euclidean distance Gram rank are both exactly 17, with an explicit positive-semidefinite Gram factorization. Two separately implemented exact symbolic/rational programs verify all 231 labelled distances, the 210 parent values and the minimal affine rank; four negative controls detect deliberately invalid variants. For a chosen theoretical complete weighted-graph scalar-oscillator model with equal unit masses and couplings w_ij=R²/d_ij², the full exact 22-by-22 Laplacian characteristic polynomial factors as chi22(z)=z(z-11)^11(z-21/2)^4 f6(z-15/2), where f6(z)=chiP7(z)/z for the canonical seven-vertex graph. The eigenvalue 11 has multiplicity exactly eleven and the eigenvalue 21/2 has multiplicity exactly four. Both root multiplicities are verified by a separately constructed rational-metric graph and exact characteristic-polynomial derivatives. They are abstract mathematical model eigenvalues, not measured frequencies. Orthogonal Euclidean completions and uniform graph-vertex joins are established mathematical techniques; no new universal theorem, new physical spacetime dimension, particle discovery or experimental resonance is claimed. Independent human peer review has not occurred. Frozen science source: Topbrutus/[email protected], commit 1ef37f156292aa80f8c3f5d07bb889dc4b4492ab. Three deposited files: fixed Git-tag source ZIP (MIT software), scientific preprint PDF (CC BY 4.0) and exact JSON certificate listing all 231 labelled squared distances. Generative AI disclosure: OpenAI ChatGPT (Astra) substantially assisted exact symbolic and rational verification software, source auditing, mathematical distance-geometry and the chosen graph spectrum, the manuscript, technical documentation and publication operations. Gabriel St-Pierre originated and directs the Polybrutus research programme and is scientifically responsible for the deposit. The AI system is not an author. No independent human peer review has yet been performed.

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