Timeline for Maximum number of distinct diagonals generated by permutations
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 18, 2017 at 13:02 | history | edited | Tony Huynh | CC BY-SA 3.0 |
added 9 characters in body
|
| Jan 18, 2017 at 12:57 | history | edited | Tony Huynh | CC BY-SA 3.0 |
added 80 characters in body; edited tags
|
| Aug 9, 2010 at 15:51 | history | edited | Charles Matthews | CC BY-SA 2.5 |
abbrev
|
| Aug 9, 2010 at 12:18 | answer | added | Tony Huynh | timeline score: 10 | |
| Aug 9, 2010 at 12:12 | comment | added | Kamil | As in, you can choose any n by n 0-1 matrix you want to maximize this number. | |
| Aug 9, 2010 at 11:09 | comment | added | Daniel Krenn | Is the question for a general upper bound or an upper bound if I know the matrix? | |
| Aug 9, 2010 at 10:52 | history | asked | Kamil | CC BY-SA 2.5 |