Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

This question is These two questions are two-dimensional variations on this recent MO question, "Threading pinholes in the wall of cylinder to pass through an internal coordinate." Noam Elkies suggested that even a 2D version might lead to interesting mathematics. Here I've taken the liberty to pose two specific 2D questions directly inspired by the original 3D question:

P1. Arrange $n$ points on a circle to maximize the smallest radius of a chord-confined disk.

The $n$ points determine $\binom{n}{2}$ chords, which partition the disk into cells. Among cells entirely bounded by chords (as opposed to bounded by chords and a circle arc), the question asks to maximize the size of the inscribed disks, i.e., to avoid any small disk. In the example below, the green disk is the smallest; I do not know if another $n=5$ arrangement results in a larger smallest disk.
           Chords

Let $r(n)$ be this max-min radius. It seems that finding the exact value of $r(n)$ for small $n$ could be interesting, as well as determining its asymptotic behavior.

Another version is:

P2. Arrange $n$ points on a circle to minimize the largest radius of an interior disk not crossed by any chord.

Call this min-max quantity $R(n)$. Note (updated) that, unlike in P1, here disks confined by chords and the outer circle are included. This is perhaps closer to the spirit of the 3D question, for then no point in the disk is ever far from a chord. Again I do not know if, for $n=5$, the blue disk above is the minimum of the largest confined disks over all 5-point arrangements. Update. Certainly not, as Simon shows in his answer. And here is a better arrangement for P2 with $n=5$, following Gerhard's suggestion (the three blue disks have the same radius):
           5R

share|improve this question
    
Would a regular hexagon for $n=6$ be deemed to have a chord-confined disc of radius zero at the center? Three chords meet there, and a very small discs appears if the configuration is perturbed a bit. –  Noam D. Elkies Oct 2 '11 at 14:22
    
@Noam: Good point! This perhaps undermines the max-min version... –  Joseph O'Rourke Oct 2 '11 at 15:01
    
I see now that P2 is flawed in the sense that if one clusters all $n$ points near one another, then they form small chord-bounded cells, and consequently a small largest disk. So perhaps I was wrong to exclude the boundary of the circle in the formulation of P2... –  Joseph O'Rourke Oct 3 '11 at 1:36
    
Altered P2 accordingly. (Sorry--Searching for the best problem definitions.) –  Joseph O'Rourke Oct 3 '11 at 10:08
    
Application for P2: Circle encloses a town, chords are utility lines, goal is to arrange lines so that any new residence will have a short connection to a utility. –  Joseph O'Rourke Oct 3 '11 at 11:46
add comment

1 Answer

The blue disk given is not the minimum size of the largest disk. By symmetry, there are only three sized involved, and the yellow disk is strictly smaller than the blue one.

So if we pick one of the five points and perturb it a little, the blue disk will shrink while one of the yellow ones next to it will grow---however, there is a non-zero amount that you can move the point before the yellow one becomes larger than the blue one.

share|improve this answer
    
@Simon: Your argument suggests that the extreme is never achieved by a lone disk---there should be balance in an extremal configuration. –  Joseph O'Rourke Oct 2 '11 at 17:34
    
For P2, one configuration to try involves all but 1 of the points on the same semicircle. Even if arcs are considered, one should be able to get a diameter of the largest circle to be less than 1/n that of the containing circle for n > 3. Gerhard "Ask Me About System Design" Paseman, 2011.10.02 –  Gerhard Paseman Oct 2 '11 at 18:23
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

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