Polybrutus 18D: Exact Conservative Euclidean Completion and a Twelvefold Weighted-Graph Mode

Reproducible exact Euclidean distance-geometry case study of 23 labelled radius-R points having minimum affine dimension 18. The construction conservatively preserves all 231 labelled squared distances of the published Polybrutus 17D (DOI 10.5281/zenodo.24409067) while adding one unit-radius orthogonal point. The new point contributes 22 squared distances equal to 2R², giving 253 labelled pairs in eight exact normalized squared-distance classes and a total squared-distance sum of 2071R²/4. Both exact coordinate-difference rank and centered squared-distance Gram rank equal 18, with an exact positive-semidefinite centered Gram factorization. Two independently implemented symbolic and rational programs verify all 253 labelled distances, 231 old labelled pairs and Gram rank, with four deliberate invalid control cases rejected. For a chosen ideal complete weighted-graph scalar-oscillator model with equal unit masses and inverse squared-distance couplings w_ij=R²/d_ij², the exact 23-by-23 weighted Laplacian has characteristic polynomial chi23(z)=z(z-23/2)^12(z-11)^4 f6(z-8), where f6(z)=chiP7(z)/z is the nonzero-mode polynomial of the original seven-point graph. Eigenvalue 23/2 has exact multiplicity twelve and eigenvalue 11 exact multiplicity four. Both results are independently reproduced using exact rational metrics and characteristic-polynomial derivative checks. These are theoretical dimensionless graph eigenvalues, not measured frequencies or physical extra dimensions. Euclidean orthogonal completions and uniform graph-spectral shifts are established mathematical techniques. No novel universal theorem, particle discovery, experimental resonance or independent human peer review is claimed. Frozen science source: Topbrutus/[email protected], immutable source commit b42aae51d92b817008c823a34162e1eb94c13cae. Three attachments: tagged Git-source ZIP (MIT software), scientific preprint PDF (CC BY 4.0) and complete JSON certificate listing all 253 exact squared labelled distances. Generative AI disclosure: OpenAI ChatGPT (Astra) substantially assisted exact geometry proofs, primary and separately implemented rational verifier source code, chosen theoretical graph spectrum calculations, source auditing, scientific preprint drafting, documentation and release operations. Gabriel St-Pierre originated and directs the Polybrutus research, and is responsible for the archived scientific work. The AI system is not a research author. Independent human peer review is pending.

Authors

Publication Details

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

Polybrutus 18D: Exact Conservative Euclidean Completion and a Twelvefold Weighted-Graph Mode

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

Polybrutus 18D: Exact Conservative Euclidean Completion and a Twelvefold Weighted-Graph Mode

Gabriel St‐Pierre
preprint en

Abstract

Reproducible exact Euclidean distance-geometry case study of 23 labelled radius-R points having minimum affine dimension 18. The construction conservatively preserves all 231 labelled squared distances of the published Polybrutus 17D (DOI 10.5281/zenodo.24409067) while adding one unit-radius orthogonal point. The new point contributes 22 squared distances equal to 2R², giving 253 labelled pairs in eight exact normalized squared-distance classes and a total squared-distance sum of 2071R²/4. Both exact coordinate-difference rank and centered squared-distance Gram rank equal 18, with an exact positive-semidefinite centered Gram factorization. Two independently implemented symbolic and rational programs verify all 253 labelled distances, 231 old labelled pairs and Gram rank, with four deliberate invalid control cases rejected. For a chosen ideal complete weighted-graph scalar-oscillator model with equal unit masses and inverse squared-distance couplings w_ij=R²/d_ij², the exact 23-by-23 weighted Laplacian has characteristic polynomial chi23(z)=z(z-23/2)^12(z-11)^4 f6(z-8), where f6(z)=chiP7(z)/z is the nonzero-mode polynomial of the original seven-point graph. Eigenvalue 23/2 has exact multiplicity twelve and eigenvalue 11 exact multiplicity four. Both results are independently reproduced using exact rational metrics and characteristic-polynomial derivative checks. These are theoretical dimensionless graph eigenvalues, not measured frequencies or physical extra dimensions. Euclidean orthogonal completions and uniform graph-spectral shifts are established mathematical techniques. No novel universal theorem, particle discovery, experimental resonance or independent human peer review is claimed. Frozen science source: Topbrutus/[email protected], immutable source commit b42aae51d92b817008c823a34162e1eb94c13cae. Three attachments: tagged Git-source ZIP (MIT software), scientific preprint PDF (CC BY 4.0) and complete JSON certificate listing all 253 exact squared labelled distances. Generative AI disclosure: OpenAI ChatGPT (Astra) substantially assisted exact geometry proofs, primary and separately implemented rational verifier source code, chosen theoretical graph spectrum calculations, source auditing, scientific preprint drafting, documentation and release operations. Gabriel St-Pierre originated and directs the Polybrutus research, and is responsible for the archived scientific work. The AI system is not a research author. Independent human peer review is 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