Polybrutus 16D: Exact Conservative Euclidean Completion and a Tenfold Weighted-Graph Mode

Exact and independently reproducible Euclidean distance geometry case study: 21 labelled radius-R points of minimum affine embedding dimension 16, conservatively extending the published Polybrutus 15D (DOI 10.5281/zenodo.24408887). All 190 predecessor pairwise squared distances are preserved exactly, and one new orthogonal point adds 20 squared distances of 2R², for 210 labelled pairs in eight normalized families and exact total squared distance 1727R²/4. The coordinate difference matrix and centered Euclidean distance Gram matrix both have exact rank 16; a symbolic positive-semidefinite Gram factorization is provided. Two separately implemented programs validate all 210 labelled squared distances, including the old 190; four negative controls reject invalid variants. A chosen theoretical complete weighted-graph scalar-oscillator model (equal unit masses and graph weights w_ij=R²/d_ij²) has the exact 21-by-21 weighted-Laplacian characteristic polynomial chi21(z)=z(z-21/2)^10(z-10)^4 f6(z-7), where f6(z)=chiP7(z)/z for the original seven-point graph. Eigenvalue 21/2 has multiplicity exactly ten; eigenvalue 10 has multiplicity exactly four. Both are checked by a separate independently constructed rational-metric graph and exact polynomial derivatives. These are not physical frequency measurements, additional physical spacetime dimensions, or novel universal mathematical theorems. Orthogonal completions and uniform weighted graph joins are established techniques. No human independent peer review has yet occurred. Frozen scientific source: Topbrutus/[email protected], commit c7700a46cb0b2c3d2556f50a207d86da84055ea0. Three deposited files: frozen tagged GitHub source ZIP (MIT code), scientific note PDF (CC BY 4.0) and complete JSON exact certificate of all 210 labelled squared distances. Generative AI disclosure: OpenAI ChatGPT (Astra) substantially assisted symbolic proof checking, primary software and separately implemented rational verification, theoretical graph spectral calculation, source auditing, scientific writing and release preparation. Gabriel St-Pierre originated and directs the Polybrutus research and is responsible for the archived work. The AI tool is not a research author. No independent human peer review has been performed.

Authors

Publication Details

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

Polybrutus 16D: Exact Conservative Euclidean Completion and a Tenfold Weighted-Graph Mode

Gabriel St‐Pierre
20 links
Zenodo (CERN European Organization for Nuclear Research)
Mathematics and Applications
preprint

Polybrutus 16D: Exact Conservative Euclidean Completion and a Tenfold Weighted-Graph Mode

Gabriel St‐Pierre
preprint en

Abstract

Exact and independently reproducible Euclidean distance geometry case study: 21 labelled radius-R points of minimum affine embedding dimension 16, conservatively extending the published Polybrutus 15D (DOI 10.5281/zenodo.24408887). All 190 predecessor pairwise squared distances are preserved exactly, and one new orthogonal point adds 20 squared distances of 2R², for 210 labelled pairs in eight normalized families and exact total squared distance 1727R²/4. The coordinate difference matrix and centered Euclidean distance Gram matrix both have exact rank 16; a symbolic positive-semidefinite Gram factorization is provided. Two separately implemented programs validate all 210 labelled squared distances, including the old 190; four negative controls reject invalid variants. A chosen theoretical complete weighted-graph scalar-oscillator model (equal unit masses and graph weights w_ij=R²/d_ij²) has the exact 21-by-21 weighted-Laplacian characteristic polynomial chi21(z)=z(z-21/2)^10(z-10)^4 f6(z-7), where f6(z)=chiP7(z)/z for the original seven-point graph. Eigenvalue 21/2 has multiplicity exactly ten; eigenvalue 10 has multiplicity exactly four. Both are checked by a separate independently constructed rational-metric graph and exact polynomial derivatives. These are not physical frequency measurements, additional physical spacetime dimensions, or novel universal mathematical theorems. Orthogonal completions and uniform weighted graph joins are established techniques. No human independent peer review has yet occurred. Frozen scientific source: Topbrutus/[email protected], commit c7700a46cb0b2c3d2556f50a207d86da84055ea0. Three deposited files: frozen tagged GitHub source ZIP (MIT code), scientific note PDF (CC BY 4.0) and complete JSON exact certificate of all 210 labelled squared distances. Generative AI disclosure: OpenAI ChatGPT (Astra) substantially assisted symbolic proof checking, primary software and separately implemented rational verification, theoretical graph spectral calculation, source auditing, scientific writing and release preparation. Gabriel St-Pierre originated and directs the Polybrutus research and is responsible for the archived work. The AI tool is not a research author. No independent human peer review has been performed.

Zenodo (CERN European Organization for Nuclear Research)
Mathematics 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