Timeline for Choosing maximum number of separated points on a sphere surface
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 20, 2021 at 10:37 | comment | added | Leo Moos | @PierrePC Oops, my bad. In any case I'm glad it worked out in this way. | |
| Mar 20, 2021 at 4:54 | answer | added | Pierre PC | timeline score: 5 | |
| Mar 20, 2021 at 3:21 | comment | added | Pierre PC | It is polynomial in $\rho$ but exponential in $d$. I think your reasoning shows it is at most $(1/\varepsilon)^d$, up to a constant and for $\rho=\cos(\varepsilon)$, or something similar. | |
| Mar 20, 2021 at 3:07 | comment | added | Leo Moos | How you come you expect an exponential bound? I'm a bit confused - what is the obstruction to a polynomial bound, perhaps obtained by summing the areas of disjoint discs centered at the points? | |
| Mar 20, 2021 at 2:56 | comment | added | Probabilist | @MattF.You are right, I want bounded above. Changed it. | |
| Mar 20, 2021 at 2:55 | history | edited | Probabilist | CC BY-SA 4.0 |
added 6 characters in body
|
| Mar 20, 2021 at 2:12 | comment | added | user44143 | Do you want the inner products bounded above? If you want them bounded below you can take arbitrarily many that are all close to the same vector | |
| Mar 20, 2021 at 2:08 | history | edited | RobPratt | CC BY-SA 4.0 |
edited tags
|
| Mar 20, 2021 at 1:22 | history | asked | Probabilist | CC BY-SA 4.0 |