Timeline for Cylinders dividing $\mathbb{R}^{3}$
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 5, 2017 at 10:26 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Image link broken; now fixed.
|
| Sep 21, 2012 at 8:49 | comment | added | Victor | Ah, the pleasures of disagreeing agreefully with the agreeable Gerhard. | |
| Sep 21, 2012 at 5:35 | comment | added | Gerhard Paseman | There. Sixth vote done. Gerhard "Ask Me About System Design" Paseman, 2012.09.20 | |
| Sep 20, 2012 at 21:18 | comment | added | Gerhard Paseman | @VCF: I think the situation is more complex than that. However, I will cast my vote and then move on. I have learned that Joseph is rather unaffected by the vote, and I appreciate the opportunity to contribute to the question and to disagree with each of you and Joseph. I look forward to more questions as well as more progress on this question. Gerhard "Agreeing To Disagree Agreefully; Agreed?" Paseman, 2012.09.20 | |
| Sep 20, 2012 at 16:45 | comment | added | Victor | @Gerhard: It´s fine you disagree. Joseph has certainly shown good effort. I voted up his first answer and acepted it. But I stand by my opinion that it is good practice to write answers that address the question somehow, not simply the comments. It has nothing to do with manners. | |
| Sep 20, 2012 at 16:07 | comment | added | Gerhard Paseman | Given the trouble Joseph has taken to help (and to further the spirit of contention), I disagree with your downvote, VCF. I will return to this later today with my voting account and give it my seventh (sixth?) vote. Gerhard "Miss Manners Might Also Disapprove" Paseman, 2012.09.20 | |
| Sep 20, 2012 at 12:06 | comment | added | Victor | Yes, I was wrong. Certainly 6 is the most with two. I had gotten the same picture with Maple. $n$ ellipsoids of any size will divide space into the maximum number of regions if any two intersect in two ellipses as the two in your configuration (i.e. in two points), any three in 8 points and any four or more have empty intersection. Roughly speaking, you may think of this conditions as happening when the defining equations are "linearly independent". The max is $n(4n^2-9n+11)/3$. I give you -1 as your answer is not related to the original question and because of the ambiguous final remark | |
| Sep 20, 2012 at 2:00 | history | answered | Joseph O'Rourke | CC BY-SA 3.0 |