Polybrutus 21D: Exact Euclidean Completion and a Fifteenfold Weighted-Graph Mode

Exact and reproducible Euclidean distance geometry case study of 26 labelled radius-R points with minimal affine embedding dimension 21. Conservatively extending the published Polybrutus 20D (DOI 10.5281/zenodo.24409424), all 300 labelled predecessor pairwise squared distances remain unchanged. A new orthogonal unit-radius vector adds 25 new squared distances of exactly 2R², giving 325 labelled pairs in eight exact normalized classes with total squared-distance sum 2647R²/4. Exact coordinate-difference rank and centered squared-distance Gram rank both equal 21. An exact positive-semidefinite Gram factorization proves Euclidean realizability. Two separately implemented symbolic and rational verifiers confirm all 325 exact labelled squared distances, all 300 parent pairs, rank 21, and exact graph spectrum multiplicities, while four deliberately invalid controls are rejected. For a chosen hypothetical complete weighted-graph scalar-oscillator model with equal scalar masses and pair weights w_ij=R²/d_ij², the exact 26-vertex Laplacian has characteristic polynomial chi26(z)=z(z-13)^15(z-25/2)^4 f6(z-19/2), with f6(z)=chiP7(z)/z for the canonical seven-point graph. The eigenvalue 13 has multiplicity exactly fifteen and the eigenvalue 25/2 multiplicity exactly four. Both are independently verified by complete exact characteristic polynomials and derivative tests using a separate rational distance reconstruction. These are dimensionless mathematical graph eigenvalues, not measured physical frequencies or extra spacetime dimensions. Euclidean orthogonal completion and uniform graph joins are established mathematical methods. No novel universal theorem, experimental particle discovery, resonance or human peer-review result is claimed. Frozen scientific code: Topbrutus/[email protected], immutable source commit f17e4d02f7442d18cdafbcbb0b62380c557e4ef2. Three attachments: immutable Git-tagged source ZIP (MIT software), scientific preprint PDF (CC BY 4.0), and JSON certificate of all 325 exact labelled squared distances. Generative AI disclosure: OpenAI ChatGPT (Astra) substantially assisted exact symbolic mathematics, programming of the primary geometry and separately implemented rational verifier, theoretical graph spectrum, provenance/source auditing, scientific manuscript writing, technical documentation and controlled GitHub/Zenodo release work. Gabriel St-Pierre originated and directs Polybrutus and is scientifically responsible for the present work. The AI system is not a research author. Independent human peer review has not been performed.

Authors

Publication Details

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

Polybrutus 21D: Exact Euclidean Completion and a Fifteenfold Weighted-Graph Mode

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

Polybrutus 21D: Exact Euclidean Completion and a Fifteenfold Weighted-Graph Mode

Gabriel St‐Pierre
preprint en

Abstract

Exact and reproducible Euclidean distance geometry case study of 26 labelled radius-R points with minimal affine embedding dimension 21. Conservatively extending the published Polybrutus 20D (DOI 10.5281/zenodo.24409424), all 300 labelled predecessor pairwise squared distances remain unchanged. A new orthogonal unit-radius vector adds 25 new squared distances of exactly 2R², giving 325 labelled pairs in eight exact normalized classes with total squared-distance sum 2647R²/4. Exact coordinate-difference rank and centered squared-distance Gram rank both equal 21. An exact positive-semidefinite Gram factorization proves Euclidean realizability. Two separately implemented symbolic and rational verifiers confirm all 325 exact labelled squared distances, all 300 parent pairs, rank 21, and exact graph spectrum multiplicities, while four deliberately invalid controls are rejected. For a chosen hypothetical complete weighted-graph scalar-oscillator model with equal scalar masses and pair weights w_ij=R²/d_ij², the exact 26-vertex Laplacian has characteristic polynomial chi26(z)=z(z-13)^15(z-25/2)^4 f6(z-19/2), with f6(z)=chiP7(z)/z for the canonical seven-point graph. The eigenvalue 13 has multiplicity exactly fifteen and the eigenvalue 25/2 multiplicity exactly four. Both are independently verified by complete exact characteristic polynomials and derivative tests using a separate rational distance reconstruction. These are dimensionless mathematical graph eigenvalues, not measured physical frequencies or extra spacetime dimensions. Euclidean orthogonal completion and uniform graph joins are established mathematical methods. No novel universal theorem, experimental particle discovery, resonance or human peer-review result is claimed. Frozen scientific code: Topbrutus/[email protected], immutable source commit f17e4d02f7442d18cdafbcbb0b62380c557e4ef2. Three attachments: immutable Git-tagged source ZIP (MIT software), scientific preprint PDF (CC BY 4.0), and JSON certificate of all 325 exact labelled squared distances. Generative AI disclosure: OpenAI ChatGPT (Astra) substantially assisted exact symbolic mathematics, programming of the primary geometry and separately implemented rational verifier, theoretical graph spectrum, provenance/source auditing, scientific manuscript writing, technical documentation and controlled GitHub/Zenodo release work. Gabriel St-Pierre originated and directs Polybrutus and is scientifically responsible for the present work. The AI system is not a research author. Independent human peer review has not 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