Timeline for Best possible sieves for the jacobsthal problem, linear programming, and the prime 2
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 2, 2021 at 18:03 | history | edited | zeb | CC BY-SA 4.0 |
replaced absolute value in denominator with positive part - not sure what I was thinking originally
|
| Oct 2, 2021 at 17:25 | comment | added | zeb | @Mark In order to compute $j_{lin}(n)$, you need to solve a linear program - for $j_{lin}(P_n)$, this linear program has $2^n$ variables (however, it seems to be the case that there are always optimal solutions where only polynomially many of the variables are nonzero). | |
| Oct 2, 2021 at 14:11 | comment | added | Mark L. Stone | Where does lLinear Programming come into the picture? It is only mentioned in the question title. | |
| S Oct 2, 2021 at 7:27 | history | suggested | Conifold | CC BY-SA 4.0 |
Fixed broken link to Hagedorn's paper
|
| Oct 2, 2021 at 4:42 | review | Suggested edits | |||
| S Oct 2, 2021 at 7:27 | |||||
| Jun 15, 2020 at 7:27 | history | edited | CommunityBot |
Commonmark migration
|
|
| Apr 13, 2017 at 12:57 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Nov 29, 2011 at 21:20 | answer | added | Fintan | timeline score: -1 | |
| Jun 16, 2011 at 2:23 | comment | added | Gerhard Paseman | I think Hagedorn covers the prime 2 in his paper, and N Saradha has kindly given me a preprint which might help with (if not directly imply) your c_d = -c_2d for odd d. If you figure out the Hangman puzzle on my registered MathOverflow page, I invite you to email me so that I can tell you more of Saradha's work. I can also send you improved bounds ala Stevens, although not as good as Iwaniec has for large n. Gerhard "Ask Me About System Design" Paseman, 2011.06.15 | |
| Jun 16, 2011 at 1:29 | history | asked | zeb | CC BY-SA 3.0 |