Timeline for Is the following DNN matrix CP?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 29, 2011 at 2:54 | vote | accept | Pawan Aurora | ||
| Jul 29, 2011 at 1:50 | answer | added | Gerhard Paseman | timeline score: 4 | |
| Jul 29, 2011 at 1:35 | comment | added | Gerhard Paseman | I think 6 times that matrix can be CP, with W being a 0-1 matrix. Each column of W will have two 1's in it, and W can be divided into three groups of columns such that no row in each group has more than a single 1 in it. This definitely resembles a combinatorial design problem. Gerhard "Ask Me About Combinatorial Design" Paseman, 2011.07.28 | |
| Jul 28, 2011 at 14:43 | comment | added | Pawan Aurora | It means that the above matrix can be expressed as $WW^T$ with all entries in the $W$ matrix non-negative. The $W$ matrix need not be square. | |
| Jul 28, 2011 at 12:31 | comment | added | Gerry Myerson | I don't know. What does "completely positive" mean? | |
| Jul 28, 2011 at 8:00 | history | edited | Pawan Aurora | CC BY-SA 3.0 |
added 2 characters in body
|
| Jul 28, 2011 at 7:55 | history | asked | Pawan Aurora | CC BY-SA 3.0 |