Timeline for Partitioning the vertices of an n-cube with random hyperplane cuts
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 1, 2012 at 23:16 | comment | added | JSE | I've added a link to the relevant biology paper in the post. | |
| Jun 1, 2012 at 22:28 | history | edited | JSE | CC BY-SA 3.0 |
added 180 characters in body
|
| Jun 1, 2012 at 17:42 | comment | added | Douglas Zare | I'd like to know the connection with evolutionary biology. There is a natural question of how many crossovers it takes to separate genes which are physically close, which might correspond to a nonuniform distribution of hyperplanes which is not symmetric in the coordinates. | |
| Jun 1, 2012 at 15:42 | comment | added | Gerhard Paseman | For those of us with broader interests, can you (edit the post to or give a couple of comments to) provide a brief summary of the original question? (Some of us might want to try a different reformulation.) Gerhard "Acquiring Minds Want To Know" Paseman, 2012.06.01 | |
| May 31, 2012 at 23:51 | answer | added | Douglas Zare | timeline score: 4 | |
| May 31, 2012 at 21:13 | comment | added | JSE | Yeah, that seemed the cleanest way to set it up. Fans of odd numbers are welcome to divide everything by two. | |
| May 31, 2012 at 20:52 | comment | added | Gerhard Paseman | Just to make sure, your notion of hyperplane means that the partition has a certain symmetry. In particular, the number of pieces with t points in the piece is always even. Is that what you want? Gerhard "Ask Me About System Design" Paseman, 2012.05.31 | |
| May 31, 2012 at 20:11 | history | asked | JSE | CC BY-SA 3.0 |