Timeline for Kernel vectors with given number of non-zero entries?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 18, 2018 at 8:26 | comment | added | Federico Poloni | You may want to look at compressed sensing --- this is the kind of problems that it aims to solve. | |
| Feb 16, 2018 at 23:54 | vote | accept | valle | ||
| Feb 16, 2018 at 23:19 | answer | added | Aaron Meyerowitz | timeline score: 2 | |
| Feb 16, 2018 at 20:52 | review | Close votes | |||
| Feb 17, 2018 at 14:55 | |||||
| Feb 16, 2018 at 20:52 | comment | added | YCor | The obvious algorithm would consist in adding, for each of the binomial($n,k$) subsets of cardinal $k$, the corresponding vanishing condition in the system, solving, and then checking if the set of solutions is not contained in any of the $n-k$ other coordinate hyperplanes. It grows exponentially with $n$... possibly the question is reasonable; a little context would help anyway. | |
| Feb 16, 2018 at 20:46 | history | edited | YCor |
edited tags
|
|
| Feb 16, 2018 at 20:31 | history | asked | valle | CC BY-SA 3.0 |