An Independent Symbolic Certification and Galois Group Proof for the 10-Point Square Packing Distance

Abstract We present a complete symbolic derivation and independent algebraic certification of the minimal polynomial of the optimal 10-point packing distance d₁₀ in a unit square [0,1]², together with a full determination of its Galois group. Starting from the corrected 12-contact rigidity graph (V1.1 corrects the erroneous edge (P₃,P₆) to the true contact edge (P₈,P₁₀)), we perform a complete symbolic elimination via Sylvester resultants, removing all 11 intermediate coordinate variables in eight steps. The result is an irreducible degree-18 integer polynomial P₁₈(d) = 0 whose smallest positive real root equals d₁₀. P₁₈(d) = 1180129·d¹⁸ − 11436428·d¹⁷ + ⋯ + 819200 = 0 New in V1.4: We determine the Galois group Gal(P₁₈/ℚ) ≅ S₁₈ via a four-step certification: (i) transitivity from irreducibility; (ii) disc(P₁₈) is not a perfect square in ℚ; (iii) primitivity; (iv) Jordan’s theorem. As a corollary, d₁₀ is not expressible by radicals over ℚ.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-08-13
DOI
https://doi.org/10.5281/zenodo.21911108
Primary Topic
VLSI and FPGA Design Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Independent Symbolic Certification and Galois Group Proof for the 10-Point Square Packing Distance

Scott Sun
Zenodo (CERN European Organization for Nuclear Research)
VLSI and FPGA Design Techniques
article

An Independent Symbolic Certification and Galois Group Proof for the 10-Point Square Packing Distance

Scott Sun
article en

Abstract

Abstract We present a complete symbolic derivation and independent algebraic certification of the minimal polynomial of the optimal 10-point packing distance d₁₀ in a unit square [0,1]², together with a full determination of its Galois group. Starting from the corrected 12-contact rigidity graph (V1.1 corrects the erroneous edge (P₃,P₆) to the true contact edge (P₈,P₁₀)), we perform a complete symbolic elimination via Sylvester resultants, removing all 11 intermediate coordinate variables in eight steps. The result is an irreducible degree-18 integer polynomial P₁₈(d) = 0 whose smallest positive real root equals d₁₀. P₁₈(d) = 1180129·d¹⁸ − 11436428·d¹⁷ + ⋯ + 819200 = 0 New in V1.4: We determine the Galois group Gal(P₁₈/ℚ) ≅ S₁₈ via a four-step certification: (i) transitivity from irreducibility; (ii) disc(P₁₈) is not a perfect square in ℚ; (iii) primitivity; (iv) Jordan’s theorem. As a corollary, d₁₀ is not expressible by radicals over ℚ.

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 18%
VLSI and FPGA Design Techniques
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.

An Independent Symbolic Certification and Galois Group Proof for the 10-Point Square Packing Distance — Scott Sun · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS