Work

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

Year: 2026
Type: article
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.
Language: English
Open Access status: green
OpenAlex ID: W7225869530
FWCI:
Cites:
Cited by:
Related to: 10