Polybrutus 32D: Exact 37-Point Euclidean Metric and Twenty-Sixfold Ideal Graph Mode

Polybrutus 32D is one exactly reproducible Euclidean labelled squared-distance metric on 37 unit vertices, conservatively extended from frozen Polybrutus 31D scientific source tag v0.1.0 (DOI 10.5281/zenodo.24411160). All 630 predecessor labelled squared distances are conserved. One new perpendicular unit point adds 36 squared distances equal to 2 at unit radius, for 666 labelled pairs. The exact rational centered Euclidean Gram is PSD with rank 32, giving minimum affine realization dimension 32 for this labelled metric. A separately stipulated ideal mathematical weighted graph has unit scalar masses and complete edge weights w_ij=1/d_ij^2. Its Laplacian has eigenvalue 37/2 with multiplicity 26 and eigenvalue 18 with multiplicity 4, checked by two independently implemented exact-rational programs. They are dimensionless model-dependent eigenvalues, not measured resonances, physical extra spacetime dimensions or particle discoveries. No universal new theorem or independent human peer review is claimed. Human scientific author and responsibility: Gabriel St-Pierre, independent researcher. OpenAI ChatGPT (Astra) materially assisted exact calculations, two verifiers, manuscript and release; AI is not a scientific author. Frozen scientific source: https://github.com/Topbrutus/polybrutus-d32/tree/v0.1.0 . Parent DOI: https://doi.org/10.5281/zenodo.24411160 . Source code MIT; scientific manuscript CC BY 4.0.

Authors

Publication Details

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

Polybrutus 32D: Exact 37-Point Euclidean Metric and Twenty-Sixfold Ideal Graph Mode

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

Polybrutus 32D: Exact 37-Point Euclidean Metric and Twenty-Sixfold Ideal Graph Mode

Gabriel St‐Pierre
preprint en

Abstract

Polybrutus 32D is one exactly reproducible Euclidean labelled squared-distance metric on 37 unit vertices, conservatively extended from frozen Polybrutus 31D scientific source tag v0.1.0 (DOI 10.5281/zenodo.24411160). All 630 predecessor labelled squared distances are conserved. One new perpendicular unit point adds 36 squared distances equal to 2 at unit radius, for 666 labelled pairs. The exact rational centered Euclidean Gram is PSD with rank 32, giving minimum affine realization dimension 32 for this labelled metric. A separately stipulated ideal mathematical weighted graph has unit scalar masses and complete edge weights w_ij=1/d_ij^2. Its Laplacian has eigenvalue 37/2 with multiplicity 26 and eigenvalue 18 with multiplicity 4, checked by two independently implemented exact-rational programs. They are dimensionless model-dependent eigenvalues, not measured resonances, physical extra spacetime dimensions or particle discoveries. No universal new theorem or independent human peer review is claimed. Human scientific author and responsibility: Gabriel St-Pierre, independent researcher. OpenAI ChatGPT (Astra) materially assisted exact calculations, two verifiers, manuscript and release; AI is not a scientific author. Frozen scientific source: https://github.com/Topbrutus/polybrutus-d32/tree/v0.1.0 . Parent DOI: https://doi.org/10.5281/zenodo.24411160 . Source code MIT; scientific manuscript CC BY 4.0.

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