Timeline for Sum-regular $\{0,1\}$-matrices
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 17, 2018 at 15:09 | vote | accept | Dominic van der Zypen | ||
| Mar 17, 2018 at 15:07 | comment | added | Dominic van der Zypen | Excellent progress, thanks for putting so much effort into this! I think I am going to accept this answer, because it answers the question for $n\in\mathbb{N}$ large enough | |
| Mar 17, 2018 at 0:48 | history | edited | Brendan McKay | CC BY-SA 3.0 |
added 424 characters in body
|
| Mar 17, 2018 at 0:01 | history | edited | Brendan McKay | CC BY-SA 3.0 |
added 1036 characters in body
|
| Mar 16, 2018 at 22:03 | comment | added | Brendan McKay | @GerhardPaseman : The unimodality would follow if a precise estimate could be found for the expected number of permutation matrices covered by a random matrix in this class. The accuracy would need to be within a small constant. So far it has only been done asymptotically as far as I am aware. | |
| Mar 16, 2018 at 14:22 | comment | added | Gerhard Paseman | What if we count ways of summing disjoint permutations? Can we estimate the numbers that way, at least towards determining unimodality? Gerhard "The Sum Of All Gears" Paseman, 2018.03.16. | |
| Mar 16, 2018 at 8:21 | history | answered | Brendan McKay | CC BY-SA 3.0 |