Timeline for Continuously selecting elements from unordered pairs
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 7, 2011 at 18:20 | comment | added | François G. Dorais | The addendum is really neat! I like the argument in favor for $\mathbb{Q}^2$. I plan on posting the construction later today... The map $p \mapsto (T_p,T^p)$ for my construction is not nearly as nice as your $p \mapsto (L_p,R_p)$. It would be interesting to know if some construction for $\mathbb{Q}^2$ does give your $L_p$ and $R_p$. | |
| Sep 7, 2011 at 17:39 | history | edited | Adam Bjorndahl | CC BY-SA 3.0 |
added some thoughts
|
| Sep 7, 2011 at 4:00 | comment | added | Adam Bjorndahl | Good point -- it makes the translation back and forth between selectors a bit more cumbersome, but I think you're right that overall it's cleaner. | |
| Sep 7, 2011 at 3:42 | comment | added | François G. Dorais | I'm happy you decided to use my terminology! Just to nitpik, I think it would be slightly better if tournaments were asymmetric ($x \mathrel{T} y$ implies $y \not\mathrel{T} x$), as they usually are in combinatorics. This also makes the openness requirement (c) a little cleaner. However, since it's obvious how to go back and forth between "strict" tournaments (like mine) and "loose" tournaments (like yours), there is really no significant difference between the two... | |
| Sep 7, 2011 at 3:09 | history | answered | Adam Bjorndahl | CC BY-SA 3.0 |