Polybrutus 29D: Exact 34-Vertex Euclidean Metric and Twenty-Threefold Ideal Graph Mode

Polybrutus 29D is a specific exact reproducible 34-point Euclidean labelled squared-distance metric. It conservatively extends the immutable Polybrutus 28D scientific source at v0.1.0 (DOI 10.5281/zenodo.24410652). All 528 predecessor labelled squared distances are conserved, and a new perpendicular unit point contributes 33 new squared distances equal to 2 at unit radius, giving 561 labelled pairs. The exact centered Euclidean Gram matrix is positive semidefinite and has rank 29, proving minimum Euclidean affine dimension 29 for this complete labelled metric. In a separately stipulated ideal unit-mass complete weighted graph with w_ij=1/d_ij^2, the weighted Laplacian has eigenvalue 17 of exact multiplicity 23 and eigenvalue 33/2 of multiplicity 4. These dimensionless graph modes are model-specific, not measured hertz, experimental particles or extra physical spacetime dimensions. The methods are known and no universal new theorem or independent human peer review is claimed. Scientific author and responsibility: Gabriel St-Pierre, independent researcher. OpenAI ChatGPT (Astra) substantially assisted exact mathematical checking, independent verification code, manuscript preparation and release; AI is not a scientific author. Frozen source: https://github.com/Topbrutus/polybrutus-d29/tree/v0.1.0 . Parent DOI: https://doi.org/10.5281/zenodo.24410652 . 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.24410724
Primary Topic
Mathematics and Applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Polybrutus 29D: Exact 34-Vertex Euclidean Metric and Twenty-Threefold Ideal Graph Mode

Gabriel St‐Pierre
Zenodo (CERN European Organization for Nuclear Research)
Mathematics and Applications
preprint

Polybrutus 29D: Exact 34-Vertex Euclidean Metric and Twenty-Threefold Ideal Graph Mode

Gabriel St‐Pierre
preprint en

Abstract

Polybrutus 29D is a specific exact reproducible 34-point Euclidean labelled squared-distance metric. It conservatively extends the immutable Polybrutus 28D scientific source at v0.1.0 (DOI 10.5281/zenodo.24410652). All 528 predecessor labelled squared distances are conserved, and a new perpendicular unit point contributes 33 new squared distances equal to 2 at unit radius, giving 561 labelled pairs. The exact centered Euclidean Gram matrix is positive semidefinite and has rank 29, proving minimum Euclidean affine dimension 29 for this complete labelled metric. In a separately stipulated ideal unit-mass complete weighted graph with w_ij=1/d_ij^2, the weighted Laplacian has eigenvalue 17 of exact multiplicity 23 and eigenvalue 33/2 of multiplicity 4. These dimensionless graph modes are model-specific, not measured hertz, experimental particles or extra physical spacetime dimensions. The methods are known and no universal new theorem or independent human peer review is claimed. Scientific author and responsibility: Gabriel St-Pierre, independent researcher. OpenAI ChatGPT (Astra) substantially assisted exact mathematical checking, independent verification code, manuscript preparation and release; AI is not a scientific author. Frozen source: https://github.com/Topbrutus/polybrutus-d29/tree/v0.1.0 . Parent DOI: https://doi.org/10.5281/zenodo.24410652 . Source code MIT; scientific manuscript CC BY 4.0.

Zenodo (CERN European Organization for Nuclear Research)
Mathematics 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