Does the smallest enclosing copy fit? Random points in a convex polygon

Drop n independent uniform points into a convex polygon K and take a smallest similar copy of K that contains them, allowing rotation. Does it lie inside K? For the disk the limiting probability is 1/2 (Mathematics Stack Exchange 4799757), and MathOverflow question 458571 asked whether the same holds for regular polygons. It does not. We prove that the probability converges to an explicit constant p(K) for every convex polygon, given by a formula over a Poisson limit model in which the optimal copy solves a linear program. For triangles the formula is explicit: p = 13/48 for the equilateral triangle, 7/24 for the right isosceles and 29/96 for the 30-60-90 triangle. For the regular q-gon, p_q = q tan(pi/q) E[Vol(T) 1{0 in int T}] + 1{q even} 8/(3q^2), with T a random tetrahedron on the edges of a prism; p_4 = 1/4, and numerically p_q settles near 0.146. The limit of the set of feasible copies is a special case of a theorem of Kabluchko, Marynych and Molchanov (Israel J. Math. 266 (2025), Theorem 4.1); the new content is the optimisation over it and the evaluation of p(K). Every theorem and corollary, and the lemma parts listed in Section 7, are formally verified in Lean 4 (standard axioms only), including finite Poisson point processes and the multivariate Mecke equation, which Mathlib lacks. The archive holds the LaTeX source, the Lean development, the simulation and formula programs and an independent recheck of the triangle values (code under the MIT licence). Version 4 of the preprint (versions 1 to 3: 8 to 24 October 2026); identical to the folder smallest-enclosing-copy at tag smallest-enclosing-copy-v4 in github.com/jvvk/mathematics.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-21
DOI
https://doi.org/10.5281/zenodo.24406641
Primary Topic
Point processes and geometric inequalities
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Does the smallest enclosing copy fit? Random points in a convex polygon

Vamshi Jandhyala
Zenodo (CERN European Organization for Nuclear Research)
Point processes and geometric inequalities
preprint

Does the smallest enclosing copy fit? Random points in a convex polygon

Vamshi Jandhyala
preprint en

Abstract

Drop n independent uniform points into a convex polygon K and take a smallest similar copy of K that contains them, allowing rotation. Does it lie inside K? For the disk the limiting probability is 1/2 (Mathematics Stack Exchange 4799757), and MathOverflow question 458571 asked whether the same holds for regular polygons. It does not. We prove that the probability converges to an explicit constant p(K) for every convex polygon, given by a formula over a Poisson limit model in which the optimal copy solves a linear program. For triangles the formula is explicit: p = 13/48 for the equilateral triangle, 7/24 for the right isosceles and 29/96 for the 30-60-90 triangle. For the regular q-gon, p_q = q tan(pi/q) E[Vol(T) 1{0 in int T}] + 1{q even} 8/(3q^2), with T a random tetrahedron on the edges of a prism; p_4 = 1/4, and numerically p_q settles near 0.146. The limit of the set of feasible copies is a special case of a theorem of Kabluchko, Marynych and Molchanov (Israel J. Math. 266 (2025), Theorem 4.1); the new content is the optimisation over it and the evaluation of p(K). Every theorem and corollary, and the lemma parts listed in Section 7, are formally verified in Lean 4 (standard axioms only), including finite Poisson point processes and the multivariate Mecke equation, which Mathlib lacks. The archive holds the LaTeX source, the Lean development, the simulation and formula programs and an independent recheck of the triangle values (code under the MIT licence). Version 4 of the preprint (versions 1 to 3: 8 to 24 October 2026); identical to the folder smallest-enclosing-copy at tag smallest-enclosing-copy-v4 in github.com/jvvk/mathematics.

Zenodo (CERN European Organization for Nuclear Research)
Point processes and geometric inequalities
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