Radius of largest n+1 balls in n-dimensional unit cube?
- From: Golabi Doon <golabidoon@xxxxxxxxx>
- Date: Tue, 13 Jan 2009 11:19:11 -0800 (PST)
Hello,
I would appreciate your help or comment about the following problem.
Consider a N dimensional space. If I want to put N+1 balls (all with
the same radius R), within the unit hypercube such that:
1. The balls do not cut through each other
2. One of the balls is at the center of the cube, i.e. at (0.5 , 0.5,
0.5, ...., 0.5)
Then what is the maximum possible R in terms of N? If not easy, a good
approximation will be helpful too.
Regards
Golabi
.
- Follow-Ups:
- Prev by Date: Re: Estimating the mean of the cumulative hypergeometric?
- Next by Date: Re: prime numbers formula please.
- Previous by thread: Please help - dynamic programming or robust optimization?
- Next by thread: Re: Radius of largest n+1 balls in n-dimensional unit cube?
- Index(es):
Relevant Pages
|