5
$\begingroup$

This is a tweak of Henry Segerman's question Can an arbitrary collection of circles of total area 1/2 fit into a circle of area 1? , but restricted to the point of possibly having a proof in the literature.

If one takes the question above and restricts it to ask for a pair of circular regions with total area 1/2 to fit into a region of area 1, one has the answer yes except in the case the circles are the same size. In such a case, one needs a common point of the two regions, as well as each circle intersecting the outer circle in a point, if one wants the interiors of the small circles to be disjoint and also a subset of the interior of the enclosing region.

I will coopt the term "pigeonholing" from combinatorics and use it for geometrical packing. In this problem it will apply to two regions of the same shape and possibly of the same size, but in general it will refer to forming a packing using translates and scalings of a given region, but rotation and reflection are not allowed. Also, in a pigeonhole packing of closed objects inside a region, the objects occupy disjoint point sets in the space and are disjoint from the pointset that is the boundary of the enclosing region.

So to use this term, one can pigeonhole pack a pair of closed circles of combined area 1/2 inside a closed circle of area 1, unless the circles in the pair are the same size.

I don't have a proof, but it seems the same holds true if I replace the word circle with the word square. Or equilateral triangle. Possibly regular polygon.

This brings us to the main question. For what convex shapes C is the following true:

"You can pigeonhole pack a pair of closed C of combined area 1/2 into a region C of area 1, unless the two C in the pair are the same size." ?

I suspect the answer is all convex compact bodies in the plane, and that this is a consequence of some combinatorial geometric result. I am not a geometer, so I hope someone who knows geometry will answer and generalize this.

Bonus points for related info like more dimensions, nonconvex shapes, nonpigeonhole packings, looking at triples instead of pairs, and other small tweaks to the question. Improvements are also welcome.

$\endgroup$
  • $\begingroup$ It should be the case that the enclosing region C has the same orientation as the packed regions. There are pentagons P where a packing exists if the outer pentagon is rotated with respect to the inner pentagons. $\endgroup$ – The Masked Avenger May 17 '15 at 1:22
  • $\begingroup$ Wait, are you asking about the case where the container region is similar to the bodies? If not, what else would stop me from taking a very thin but long strip as the container, so that not even one body fits. $\endgroup$ – Zsbán Ambrus May 17 '15 at 9:31
  • $\begingroup$ @ZsbánAmbrus , yes, all of the regions discussed are the same shape and orientation. If rotation or reflection were allowed, I could loosely pack two very obtuse triangles in a larger triangle. $\endgroup$ – The Masked Avenger May 17 '15 at 15:58
2
$\begingroup$

Suppose you want to pigeonhole pack $aC$ and $bC$ into $C$, $a^2+b^2=1/2$, and $a\neq b$. Let $c=\tfrac12(a+(1-b))$, then $a<c<(1-b)$. Pick any direction $u\in S^1$, and let $w=w_u(C)$ be the width of $C$. There are two parallel lines $L_1$ and $L_2$ perpendicular to $u$ that bound $C$ and are a distance $w$ apart. Add another line $L_3$ a distance $cw$ from $L_1$. This line slices $C$ into two regions $A$ and $B$ such that $w_u(A)=c w>aw$ and $w_u(B)=(1-c)w>bw$. $A$ is the maximal subset of $C$ that contains $C\cap L_1$ and has width no greater than $cw$. Therefore it also contains a dilation of $C$ by a factor $c$ about a point in $C\cap L_1$. We now have immediately that $A$ contains a translate of $aC$ in its interior. The same argument works for $B$ containing $bC$.

For the "unless" part, the line separating the two pigeonhole packed copies of $\tfrac12C$ slices $C$ into two regions. The width of each slice is more than half the width of $C$, so you get a contradiction.

$\endgroup$
  • $\begingroup$ This should also work for pigeonholing $aC$ and $bC$ into $C$ in $d$ dimensions as long as $a+b<1$. $\endgroup$ – Yoav Kallus May 17 '15 at 3:16
  • $\begingroup$ Are you assuming convex C, or is this even more general? In any case it is looking like a good argument. $\endgroup$ – The Masked Avenger May 17 '15 at 4:32
  • 1
    $\begingroup$ Yes, I am assuming $C$ is convex, which is needed for $A$ to contain $cC$. There are nonconvex bodies that don't contain a translate of their half-shrunk versions, and then things are hopeless. $\endgroup$ – Yoav Kallus May 17 '15 at 6:26
  • $\begingroup$ could this approach generalize to three or four shapes? I'm thinking for the case of three shapes, draw one bisecting line, and then find a bisecting perpendicular ray of appropriate width coming off that line? $\endgroup$ – The Masked Avenger Jun 4 '15 at 5:57

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.