Polybrutus 30D: Exact 35-Point Euclidean Metric and Twenty-Fourfold Ideal Graph Mode

Polybrutus 30D is a specific exact reproducible 35-point Euclidean labelled squared-distance metric, conservatively extended from the immutable Polybrutus 29D scientific tag v0.1.0 (DOI 10.5281/zenodo.24410725). All 561 parent labelled squared distances are preserved; a new perpendicular unit point adds 34 squared distances equal to 2 at unit radius, for 595 pairs total. The centered Euclidean Gram matrix is positive semidefinite with exact rank 30, proving minimal affine realization dimension 30. In a separately stipulated mathematical model, a complete unit-mass weighted graph with w_ij=1/d_ij^2 has Laplacian eigenvalue 35/2 of multiplicity 24 and eigenvalue 17 of multiplicity 4. These dimensionless graph modes are not measured hertz, particles, or evidence of extra physical spacetime dimensions. Orthogonal extensions and uniform graph joins are established methods; no new universal 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 independent verifier scripts, manuscript and release operations; AI is not a scientific author. Frozen source: https://github.com/Topbrutus/polybrutus-d30/tree/v0.1.0 . Parent DOI: https://doi.org/10.5281/zenodo.24410725 . 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.24411017
Primary Topic
Graph theory and applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Polybrutus 30D: Exact 35-Point Euclidean Metric and Twenty-Fourfold Ideal Graph Mode

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

Polybrutus 30D: Exact 35-Point Euclidean Metric and Twenty-Fourfold Ideal Graph Mode

Gabriel St‐Pierre
preprint en

Abstract

Polybrutus 30D is a specific exact reproducible 35-point Euclidean labelled squared-distance metric, conservatively extended from the immutable Polybrutus 29D scientific tag v0.1.0 (DOI 10.5281/zenodo.24410725). All 561 parent labelled squared distances are preserved; a new perpendicular unit point adds 34 squared distances equal to 2 at unit radius, for 595 pairs total. The centered Euclidean Gram matrix is positive semidefinite with exact rank 30, proving minimal affine realization dimension 30. In a separately stipulated mathematical model, a complete unit-mass weighted graph with w_ij=1/d_ij^2 has Laplacian eigenvalue 35/2 of multiplicity 24 and eigenvalue 17 of multiplicity 4. These dimensionless graph modes are not measured hertz, particles, or evidence of extra physical spacetime dimensions. Orthogonal extensions and uniform graph joins are established methods; no new universal 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 independent verifier scripts, manuscript and release operations; AI is not a scientific author. Frozen source: https://github.com/Topbrutus/polybrutus-d30/tree/v0.1.0 . Parent DOI: https://doi.org/10.5281/zenodo.24410725 . 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