Timeline for The lattice spanned by $m$ random 0-1 vectors of length $n$
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 15 at 12:44 | history | edited | Jukka Kohonen | CC BY-SA 4.0 |
typo in title
|
| Sep 27, 2012 at 1:17 | vote | accept | Gil Kalai | ||
| Sep 27, 2012 at 1:17 | history | bounty ended | Gil Kalai | ||
| Sep 27, 2012 at 1:17 | history | bounty started | Gil Kalai | ||
| Sep 1, 2012 at 6:33 | answer | added | anonymous | timeline score: 1 | |
| Sep 1, 2012 at 0:25 | comment | added | Gerhard Paseman | Too bad you aren't asking for roughly 1/4. arxiv.org/abs/math/0511636 has some data about 0-1 matrices whose Smith Normal Form is the identity, which is roughly a fourth of all matrices for small n. (It also kindly quotes a result of mine in another section. Full disclosure and all that.) It would not surprise me if n + O(loglogn) were achievable. Gerhard "Ask Me About System Design" Paseman, 2012.08.31 | |
| Aug 31, 2012 at 23:00 | answer | added | Kevin P. Costello | timeline score: 2 | |
| Jul 3, 2012 at 22:01 | answer | added | Kevin P. Costello | timeline score: 6 | |
| Jul 3, 2012 at 20:31 | comment | added | Gil Kalai | Will, yes e.g. what is m as a function of m so that the probability is roughly 1/2. | |
| Jul 3, 2012 at 19:47 | comment | added | Will Sawin | For the first question, are you holding this positive probability fixed as $n$ varies? | |
| Jul 3, 2012 at 18:00 | answer | added | Igor Rivin | timeline score: 3 | |
| Jul 3, 2012 at 17:45 | history | asked | Gil Kalai | CC BY-SA 3.0 |