Timeline for What is the most general "two in one row for A & in one column for B" theorem?
Current License: CC BY-SA 3.0
11 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Feb 8, 2012 at 18:56 | vote | accept | darij grinberg | ||
Feb 8, 2012 at 18:56 | history | edited | darij grinberg | CC BY-SA 3.0 |
added 192 characters in body
|
Jan 7, 2012 at 10:59 | history | edited | darij grinberg | CC BY-SA 3.0 |
also, fixed typo
|
Jul 18, 2010 at 21:15 | history | edited | darij grinberg | CC BY-SA 2.5 |
typo fix
|
Jul 12, 2010 at 22:50 | history | edited | darij grinberg | CC BY-SA 2.5 |
added 79 characters in body
|
Jul 12, 2010 at 21:06 | answer | added | Matt Fayers | timeline score: 8 | |
Jul 11, 2010 at 8:44 | answer | added | Philippe Nadeau | timeline score: 1 | |
Jul 11, 2010 at 7:44 | comment | added | darij grinberg | Good point. Edited my post. The context is representation theory of $S_n$; my main interest in the generalization is the hope that its proof will be less ugly than that for (c) (as usually general results have nicer proofs). | |
Jul 11, 2010 at 7:43 | history | edited | darij grinberg | CC BY-SA 2.5 |
added 142 characters in body
|
Jul 11, 2010 at 0:23 | comment | added | Victor Protsak | Please, clarify what you mean by "Young tableau": is it weight $(1,1,\ldots,1)$ (i.e. the entries are $1,2,\ldots,n$)? Also, what is the context for these technical lemmas? | |
Jul 10, 2010 at 23:10 | history | asked | darij grinberg | CC BY-SA 2.5 |