Sixty-two improved lower bounds for packings of regular polygons with maximum total perimeter

Erich Friedman's Packing Center lists the best known packings of n regular polygons of freely chosensizes inside a unit triangle, square, pentagon or circle, where the sum of the side lengths is to be aslarge as possible. This paper reports 62 packings, with n between 21 and 50, whose totals exceed thevalues published on 10 November 2026. They were found by basin hopping, an exact polish by sequentiallinear programming, and a search restricted to symmetric packings. Each packing is given as acertificate of decimal coordinates and was checked in 60-digit arithmetic by an independent programincluded in the supplement. No packing is claimed to be optimal. The work was carried out by an AIsystem (Claude Fable 5.2, Anthropic) under the author's direction, as described in the paper.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-12
DOI
https://doi.org/10.5281/zenodo.24179285
Primary Topic
Optimization and Packing Problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Sixty-two improved lower bounds for packings of regular polygons with maximum total perimeter

Sean Harding
Zenodo (CERN European Organization for Nuclear Research)
Optimization and Packing Problems
article

Sixty-two improved lower bounds for packings of regular polygons with maximum total perimeter

Sean Harding
article en

Abstract

Erich Friedman's Packing Center lists the best known packings of n regular polygons of freely chosensizes inside a unit triangle, square, pentagon or circle, where the sum of the side lengths is to be aslarge as possible. This paper reports 62 packings, with n between 21 and 50, whose totals exceed thevalues published on 10 November 2026. They were found by basin hopping, an exact polish by sequentiallinear programming, and a search restricted to symmetric packings. Each packing is given as acertificate of decimal coordinates and was checked in 60-digit arithmetic by an independent programincluded in the supplement. No packing is claimed to be optimal. The work was carried out by an AIsystem (Claude Fable 5.2, Anthropic) under the author's direction, as described in the paper.

Zenodo (CERN European Organization for Nuclear Research)
Optimization and Packing Problems
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