Timeline for Number of non-singular matrices with entries in $\{1, -1\}$
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 31, 2022 at 11:22 | comment | added | Arun | @Peter Thank you very much. Please post your comment as an answer, I will upvote it. | |
| Jan 31, 2022 at 11:11 | comment | added | Peter Taylor | With respect to @mathworker21's comment, this recent pre-print tightens some old bounds, but the old bounds are enough to say that asymptotically almost all such matrices are non-singular. | |
| Jan 31, 2022 at 6:18 | comment | added | Arun | @Gerald only one. | |
| Jan 30, 2022 at 22:35 | comment | added | mathworker21 | this can be equivalently phrased as probability a random $\pm 1$ $n\times n$ matrix is non-singular, which is very hard (I think) | |
| Jan 30, 2022 at 21:07 | comment | added | Gerald Edgar | What do you get for $n=1, n=2, n=3$? | |
| Jan 30, 2022 at 20:55 | history | edited | Arun | CC BY-SA 4.0 |
deleted 5 characters in body
|
| Jan 30, 2022 at 20:23 | history | asked | Arun | CC BY-SA 4.0 |