Timeline for Implicit inequality
Current License: CC BY-SA 4.0
5 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Aug 23, 2019 at 8:17 | answer | added | Max Alekseyev | timeline score: 2 | |
Aug 23, 2019 at 6:57 | comment | added | Pietro Majer | To improve a bit your bound you may multiply $(*)$ by $\lambda ^{\frac{ d+1}{d}}$, deducing a family of $(*)_\lambda$ for $\lambda x$, with $\lambda$ in the range of validity of your initial bound (that is, with corresponding $A_\lambda\ge1, B_\lambda\ge1$). Then you may optimize w.r.to $\lambda$ the corresponding bound on $x$ given by $(**)_\lambda$ | |
Aug 23, 2019 at 6:44 | comment | added | Aryeh Kontorovich | on all 3 -- otherwise, the claim is false | |
Aug 23, 2019 at 6:40 | comment | added | Pietro Majer | Is the initial condition greater than or equal to $1$ only imposed on $d$, or on $A$ and $B$ too? | |
Aug 23, 2019 at 6:08 | history | asked | Aryeh Kontorovich | CC BY-SA 4.0 |