Timeline for Product of arithmetic progressions
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 25, 2018 at 10:04 | vote | accept | pi66 | ||
| Oct 18, 2018 at 8:12 | comment | added | Yaakov Baruch | Update: the regressions mentioned in my answer can mostly be replaced by much easier/faster computations of the ranks of the $5\times n$ matrices with rows given by $(1,1,\dots 1),(1,2,\dots n),{\bf u},{\bf v},{\bf uv}$; then for the matrices with rank < $5$ further checks are needed to rule out, or compute, the explicit examples. | |
| Oct 17, 2018 at 7:39 | comment | added | Yaakov Baruch | Above, I a ruled out the singular cases with ${\bf u}=n+1-{\bf v}$. The 4-variate regression is singular in that case, but in theory a perfect fit (with one degree of freedom in the coefficients) could be achieved there too. Maybe there is a very short argument why that cannot be, but in any case I ruled it out by running the corresponding 3-variate regressions, with ${\bf intercept},{\bf u},{\bf uv}$ as $x$-variables, and no perfect fit was found for $n=6,7$. | |
| Oct 17, 2018 at 3:41 | history | edited | Yaakov Baruch | CC BY-SA 4.0 |
added 6 characters in body
|
| Oct 16, 2018 at 21:50 | history | edited | Yaakov Baruch | CC BY-SA 4.0 |
added 188 characters in body
|
| Oct 16, 2018 at 21:45 | history | edited | Yaakov Baruch | CC BY-SA 4.0 |
added 188 characters in body
|
| Oct 16, 2018 at 21:28 | history | edited | Yaakov Baruch | CC BY-SA 4.0 |
deleted 5 characters in body
|
| Oct 16, 2018 at 21:21 | history | edited | Yaakov Baruch | CC BY-SA 4.0 |
added 1 character in body
|
| Oct 16, 2018 at 21:15 | history | edited | Yaakov Baruch | CC BY-SA 4.0 |
edited body
|
| Oct 16, 2018 at 21:06 | history | answered | Yaakov Baruch | CC BY-SA 4.0 |