Timeline for Count of binary matrices that avoids a certain sub-matrix
Current License: CC BY-SA 2.5
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 3, 2010 at 17:24 | answer | added | Max Alekseyev | timeline score: 0 | |
| Jul 3, 2010 at 7:17 | history | edited | Charles Chen | CC BY-SA 2.5 |
added 151 characters in body
|
| Jul 3, 2010 at 7:16 | comment | added | Charles Chen | Yeah, abstract finite sets. The basic concrete example is Young's lattice. | |
| Jul 3, 2010 at 7:09 | answer | added | Suresh Venkat | timeline score: 7 | |
| Jul 3, 2010 at 6:13 | comment | added | Leonid Petrov | But which concrete examples you consider? Purely abstract finite sets? | |
| Jul 3, 2010 at 4:04 | answer | added | Michael Lugo | timeline score: -1 | |
| Jul 3, 2010 at 4:01 | answer | added | Douglas S. Stones | timeline score: 4 | |
| Jul 3, 2010 at 2:49 | comment | added | Charles Chen | The set of elements of rank n. | |
| Jul 3, 2010 at 1:36 | comment | added | Leonid Petrov | A little offtop, but what you take as $R_n$'s? | |
| Jul 3, 2010 at 0:33 | history | asked | Charles Chen | CC BY-SA 2.5 |