Timeline for 0-1 matrix combinatorial problem
Current License: CC BY-SA 3.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 9, 2017 at 22:45 | history | edited | Penelope Benenati | CC BY-SA 3.0 |
added 184 characters in body
|
| Dec 6, 2017 at 11:54 | history | edited | Penelope Benenati | CC BY-SA 3.0 |
added 111 characters in body
|
| Dec 6, 2017 at 11:42 | history | edited | Penelope Benenati | CC BY-SA 3.0 |
added 30 characters in body
|
| Dec 6, 2017 at 11:16 | history | edited | Penelope Benenati | CC BY-SA 3.0 |
added 15 characters in body
|
| Dec 6, 2017 at 11:08 | history | edited | Penelope Benenati | CC BY-SA 3.0 |
added 640 characters in body
|
| S Dec 5, 2017 at 12:22 | history | suggested | Rodrigo de Azevedo | CC BY-SA 3.0 |
Minor edits
|
| Dec 5, 2017 at 7:28 | review | Suggested edits | |||
| S Dec 5, 2017 at 12:22 | |||||
| Dec 4, 2017 at 22:59 | comment | added | Greg Martin | (I suggest editing those comments into the question) | |
| Dec 4, 2017 at 20:30 | comment | added | Penelope Benenati | Do we have $R_{max}=\Theta\left((1/p-1)\,(n^{1/3}-1)\right)$ for any constant $c>0$ and $p \in (0,1/2]$? | |
| Dec 4, 2017 at 20:29 | history | edited | Penelope Benenati | CC BY-SA 3.0 |
added 2 characters in body
|
| Dec 4, 2017 at 20:07 | comment | added | Penelope Benenati | Think about having the first $n^{1/3}-1$ rows with all of their $1$s in the first $pn$ columns, the second $n^{1/3}-1$ rows with all their $1$s in the second $pn$ columns, and so on. This construction allows me to see that, for any constant $c>0$, we have $R_{max} \ge \left(\frac{1}{p}-1\right)\,(n^{1/3}-1)$. It is not clear to me whether there exists a matrix construction showing that $R_{max} = \omega\left(\left(\frac{1}{p}-1\right)\,(n^{1/3}-1)\right)$ for some constant $c>0$, when $n$ approaches infinity. | |
| Dec 4, 2017 at 10:17 | comment | added | Greg Martin | What relative sizes of $p$ and $c$ are you interested in? What do simple constructions yield (like having the first $pn$ rows have all of their $1$s in the first $pn$ columns, the second $pn$ rows having all their $1$s in the second $pn$ columns, etc.), and do you think there are better constructions? I'm guessing you've done some work on this problem already, and it will enable actual helpful responses if you don't make readers reconstruct what you already know. | |
| Dec 4, 2017 at 10:13 | history | edited | Penelope Benenati | CC BY-SA 3.0 |
edited body
|
| Dec 4, 2017 at 10:13 | comment | added | Penelope Benenati | Of course, sorry, I correct. Thanks. | |
| Dec 4, 2017 at 10:11 | comment | added | Greg Martin | Presumably you mean $r_ir^T$? | |
| Dec 4, 2017 at 10:04 | history | asked | Penelope Benenati | CC BY-SA 3.0 |