Polybrutus 20D: Exact Conservative Euclidean Completion and a Fourteenfold Weighted-Graph Mode

Reproducible exact mathematical Euclidean distance-geometry case study: 25 labelled radius-R points of minimum affine embedding dimension twenty. Conservatively extending the published Polybrutus 19D (DOI 10.5281/zenodo.24409343), all 276 predecessor labelled squared pair distances remain precisely unchanged. One additional perpendicular unit-radius vertex introduces 24 squared pair distances equal to 2R², giving 300 exact labelled pair distances in eight normalized families and total squared-distance sum 2447R²/4. The coordinate-difference rank and centered squared Euclidean distance Gram rank both equal 20, with an explicit exact positive-semidefinite Gram factorization. Two separately implemented symbolic and rational programs verify all 300 labelled squared distances, 276 frozen predecessor values, affine Gram rank and theoretical graph-spectrum multiplicities; four deliberately invalid controls are rejected. For a chosen hypothetical complete weighted-graph scalar-oscillator model with equal unit scalar masses and edge couplings w_ij=R²/d_ij², the exact 25-by-25 weighted Laplacian has characteristic polynomial chi25(z)=z(z-25/2)^14(z-12)^4 f6(z-9), where f6(z)=chiP7(z)/z is the nonzero-mode polynomial from the canonical seven-point model graph. Eigenvalue 25/2 has exact multiplicity fourteen and eigenvalue 12 exact multiplicity four. Both are independently verified via the rational full-distance matrix and characteristic-polynomial derivatives. These are dimensionless abstract model eigenvalues, not experimental frequencies or physical spacetime dimensions. Orthogonal Euclidean completions and uniform graph joins are established mathematical techniques. This is a reproducible specific case study, not a newly discovered universal mathematical theorem, new elementary particle, physical extra dimension or experimental resonance. Independent human peer review has not occurred. Frozen scientific code Topbrutus/[email protected], fixed science commit 3e9ee3117f1c3c3e5ffc80236fa2026a5d825ce3. Three archived attachments: immutable tagged-source ZIP (MIT code), scientific preprint PDF (CC BY 4.0), and complete JSON certificate of 300 exact labelled squared distances. Generative AI disclosure: OpenAI ChatGPT (Astra) substantially assisted exact symbolic mathematics, design and programming of primary code and a separately implemented rational checker, theoretical model graph spectrum, source auditing, research note drafting, technical documentation and GitHub/Zenodo release operations. Gabriel St-Pierre originated and directs the Polybrutus programme and is scientifically responsible for this deposit. The AI system is not a human author. Human independent 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.24409423
Primary Topic
Graph theory and applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Polybrutus 20D: Exact Conservative Euclidean Completion and a Fourteenfold Weighted-Graph Mode

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

Polybrutus 20D: Exact Conservative Euclidean Completion and a Fourteenfold Weighted-Graph Mode

Gabriel St‐Pierre
preprint en

Abstract

Reproducible exact mathematical Euclidean distance-geometry case study: 25 labelled radius-R points of minimum affine embedding dimension twenty. Conservatively extending the published Polybrutus 19D (DOI 10.5281/zenodo.24409343), all 276 predecessor labelled squared pair distances remain precisely unchanged. One additional perpendicular unit-radius vertex introduces 24 squared pair distances equal to 2R², giving 300 exact labelled pair distances in eight normalized families and total squared-distance sum 2447R²/4. The coordinate-difference rank and centered squared Euclidean distance Gram rank both equal 20, with an explicit exact positive-semidefinite Gram factorization. Two separately implemented symbolic and rational programs verify all 300 labelled squared distances, 276 frozen predecessor values, affine Gram rank and theoretical graph-spectrum multiplicities; four deliberately invalid controls are rejected. For a chosen hypothetical complete weighted-graph scalar-oscillator model with equal unit scalar masses and edge couplings w_ij=R²/d_ij², the exact 25-by-25 weighted Laplacian has characteristic polynomial chi25(z)=z(z-25/2)^14(z-12)^4 f6(z-9), where f6(z)=chiP7(z)/z is the nonzero-mode polynomial from the canonical seven-point model graph. Eigenvalue 25/2 has exact multiplicity fourteen and eigenvalue 12 exact multiplicity four. Both are independently verified via the rational full-distance matrix and characteristic-polynomial derivatives. These are dimensionless abstract model eigenvalues, not experimental frequencies or physical spacetime dimensions. Orthogonal Euclidean completions and uniform graph joins are established mathematical techniques. This is a reproducible specific case study, not a newly discovered universal mathematical theorem, new elementary particle, physical extra dimension or experimental resonance. Independent human peer review has not occurred. Frozen scientific code Topbrutus/[email protected], fixed science commit 3e9ee3117f1c3c3e5ffc80236fa2026a5d825ce3. Three archived attachments: immutable tagged-source ZIP (MIT code), scientific preprint PDF (CC BY 4.0), and complete JSON certificate of 300 exact labelled squared distances. Generative AI disclosure: OpenAI ChatGPT (Astra) substantially assisted exact symbolic mathematics, design and programming of primary code and a separately implemented rational checker, theoretical model graph spectrum, source auditing, research note drafting, technical documentation and GitHub/Zenodo release operations. Gabriel St-Pierre originated and directs the Polybrutus programme and is scientifically responsible for this deposit. The AI system is not a human author. Human independent 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