Search arXivSearch

arXiv · 2607.22379

Extremal fences with polyforms

Abstract

We present results around an isoperimetric problem built on polyforms: What is the biggest enclosed area one can build using polyforms in each of the three plane tessellations? We give challenges to the readers and present Shimauchi's proof of the biggest area a fence made of pentominoes can enclose. A translation of the instance using integer linear programming is also given. A companion web app is available to test some of the challenges we propose and for activities, and we included extra pages with a cutout handout of the board and pieces of the puzzles, so that you can print and cut them to read this paper hands on.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexis Langlois-Rémillard, Mia N. Müßig, Érika Roldán. 2026-07-24. Extremal fences with polyforms. https://doi.org/10.1515/dmvm-2025-0056

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The Stairs of Reconciliation: A Mathematical Tourist in Graz

Inside the Grazer Burg, two late-Gothic stone flights rise about distinct spindles, overlap, share several treads, and separate again. Their plan is governed not by a coaxial double helix but, to first approximation, by two intersecting circles. This elementary geometry yields a model of recurrent meeting and makes explicit the compatibility conditions that meeting requires. It also leads to a second object that geometers call a double spiral staircase - the helicoid - and to a useful distinction between resemblance and identity. The staircase becomes a meditation on how paths, models, and disciplines can meet without becoming the same.

math.HO

On the Reconstruction of SAS from Other Triangle Congruence Criteria

Starting from a Hilbert plane and removing the Side-Angle-Side (SAS) congruence axiom, we investigate to what extent SAS can be recovered synthetically from the remaining classical triangle congruence criteria. We show that the Angle-Side-Angle criterion, together with a ray correspondence principle corresponding to Theorem 13 of Hilbert's \emph{Grundlagen der Geometrie}, suffices to reconstruct SAS. We further show that both the Side-Side-Side and the Side-Angle-Angle criteria also suffice, once combined with the ray correspondence principle and suitable auxiliary principles -- the existence of midpoints and a hypotenuse-angle criterion for right triangles in the first case, and the existence of angle bisectors, the congruence of supplements of congruent angles, and the Pons Asinorum in the second. Although the two routes rely on auxiliary principles of different character, we show that they converge on a single final argument once a common hypotenuse-angle criterion is established. A metamathematical analysis, based on an explicit model adapted from Hilbert's own independence construction, complements these reconstructions: it shows that the ray correspondence principle alone cannot reconstruct any of the classical criteria, and that the Pons Asinorum and the hypotenuse-angle criterion are each independent of the remaining auxiliary principles used in their respective reconstructions. The resulting picture is not a formal hierarchy of the congruence criteria, but it does show that the Angle-Side-Angle reconstruction rests on a provably more economical basis than those obtained from Side-Side-Side or Side-Angle-Angle.

math.HO

Come for the vibe, stay for the math

This article describes our experiences in mathematical outreach over the past decade. We talk about specific activities, but also general principles that we've learned along the way.

math.HO