Timeline for Generalizations of Boolean posets/lattices
Current License: CC BY-SA 2.5
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 10, 2011 at 21:06 | answer | added | Todd Trimble | timeline score: 7 | |
| May 10, 2011 at 15:35 | answer | added | Gejza Jenča | timeline score: 1 | |
| Mar 1, 2010 at 17:48 | answer | added | Gerhard Paseman | timeline score: 1 | |
| Mar 1, 2010 at 9:37 | history | edited | Charles Stewart |
edited tags
|
|
| Nov 24, 2009 at 2:55 | comment | added | Harrison Brown | I guess I really don't care that much about it, since I'm really mostly concerned with finite sets. It would be interesting to know if there's some way of looking at these things as sets of a topological space, though. | |
| Nov 23, 2009 at 23:28 | comment | added | Qiaochu Yuan | I also don't understand what you mean by an analogue of Stone's theorem. What part of it do you care about? | |
| Nov 23, 2009 at 19:05 | answer | added | Joel David Hamkins | timeline score: 7 | |
| Nov 23, 2009 at 13:49 | answer | added | Qiaochu Yuan | timeline score: 5 | |
| Nov 23, 2009 at 13:29 | answer | added | Gil Kalai | timeline score: 12 | |
| Nov 23, 2009 at 6:58 | comment | added | Harrison Brown | Sort of the driving question here, FWIW, is the relationship between extremal combinatorics of set systems and Ramsey theory, in particular (and most concretely) the point of view in which we take (density) Hales-Jewett to be a generalization of Sperner's theorem. | |
| Nov 23, 2009 at 6:53 | history | asked | Harrison Brown | CC BY-SA 2.5 |