Timeline for Horst Knörrer's Permutation Cancellation Problem
Current License: CC BY-SA 2.5
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Dec 20, 2013 at 10:19 | vote | accept | Gil Kalai | ||
| Dec 9, 2013 at 21:54 | answer | added | Gil Kalai | timeline score: 8 | |
| Apr 23, 2011 at 20:29 | vote | accept | Gil Kalai | ||
| Jul 12, 2013 at 21:38 | |||||
| Apr 23, 2011 at 20:29 | history | bounty ended | Gil Kalai | ||
| Apr 17, 2011 at 11:26 | history | bounty started | Gil Kalai | ||
| Apr 2, 2011 at 8:56 | history | edited | Gil Kalai | CC BY-SA 2.5 |
added 905 characters in body
|
| Mar 25, 2011 at 10:06 | comment | added | Gil Kalai | I dont think it forces the answer to be 0 or 1 | |
| Mar 25, 2011 at 9:32 | comment | added | Colin McQuillan | Does the simplification in 4 force the value to be zero or one? Assume that the sequences $x_k$ and $y_k$ are nondecreasing. Then the condition $y_{\pi(k)}\leq x_k$ is equivalent to $\pi(k)\leq l(k)$ for some nondecreasing function $l(k)$. If $l(k)>=2$, then the total contribution for fixed $\{k:\pi(k)\leq l(1)\}$ is the determinant of the l(1)-by-l(1) all-one matrix, so zero. | |
| Mar 25, 2011 at 8:27 | history | edited | Gil Kalai | CC BY-SA 2.5 |
edited body
|
| Mar 25, 2011 at 8:11 | history | edited | Gil Kalai | CC BY-SA 2.5 |
added 2 characters in body; edited tags
|
| Mar 25, 2011 at 7:36 | history | edited | Gil Kalai | CC BY-SA 2.5 |
added 87 characters in body; added 1 characters in body
|
| Mar 25, 2011 at 7:31 | history | asked | Gil Kalai | CC BY-SA 2.5 |