Timeline for Bounds on near-zero integer linear combinations of numbers linearly independent over $\mathbb{Q}$
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 19, 2017 at 9:51 | answer | added | Jan-Christoph Schlage-Puchta | timeline score: 3 | |
| Mar 18, 2017 at 17:49 | comment | added | GH from MO | Well, if $\alpha_1=1$, then for any choice of $m_2,\dots,m_N$ there is at most one good choice of $m_1$, so in this case $f(N)\leq (2N+1)^{N-1}$. This is still trivial, of course. | |
| Mar 18, 2017 at 17:38 | history | edited | Izaak Meckler | CC BY-SA 3.0 |
added 616 characters in body; edited title
|
| Mar 18, 2017 at 16:51 | comment | added | GH from MO | Interesting question, but you probably want to specify it more, otherwise one can say that $f(N)\leq(2N+1)^N$ is a trivial upper bound. | |
| Mar 18, 2017 at 3:37 | history | edited | Izaak Meckler | CC BY-SA 3.0 |
added 304 characters in body
|
| Mar 17, 2017 at 19:18 | history | asked | Izaak Meckler | CC BY-SA 3.0 |