Polybrutus 33D: Exact 38-Point Euclidean Metric and Twenty-Sevenfold Ideal Graph Mode
Polybrutus 33D is an exactly reproducible 38-point Euclidean labelled squared-distance metric conservatively extended from the frozen Polybrutus 32D scientific source tag v0.1.0 (DOI 10.5281/zenodo.24411375). All 666 predecessor labelled squared pair distances are conserved, and a new perpendicular unit point contributes 37 squared distances equal to 2 at unit radius, giving 703 labelled pairs. The centered Euclidean Gram matrix is positive semidefinite of exact rank 33, proving minimum affine Euclidean dimension 33 for this complete metric. For a separately stipulated mathematical complete weighted graph with unit scalar masses and w_ij=1/d_ij^2, the weighted-Laplacian eigenvalue 19 has multiplicity 27 and eigenvalue 37/2 has multiplicity 4, independently checked with two exact-rational programs. They are dimensionless selected-model properties, not measured resonances, particles or additional physical spacetime dimensions. Orthogonal extensions and uniform graph joins are established methods; no new universal theorem or independent human peer review is claimed. Scientific author and responsibility: Gabriel St-Pierre, independent researcher. OpenAI ChatGPT (Astra) materially assisted exact calculations, verification programs, manuscript and controlled release; AI is not a scientific author. Frozen scientific source: https://github.com/Topbrutus/polybrutus-d33/tree/v0.1.0 . Parent DOI: https://doi.org/10.5281/zenodo.24411375 . Software MIT; scientific manuscript CC BY 4.0.
Authors
- Gabriel St‐Pierre
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-21
- DOI
- https://doi.org/10.5281/zenodo.24411568
- Primary Topic
- Graph theory and applications
- Type
- preprint