Timeline for Counting primitive lattice points
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 21, 2018 at 0:13 | vote | accept | Daniel Loughran | ||
| Apr 20, 2018 at 19:50 | answer | added | Luca Ghidelli | timeline score: 16 | |
| Apr 20, 2018 at 18:17 | comment | added | Daniel Loughran | I don't need an explicit $C_n$; $\ll_n$ is fine. | |
| Apr 20, 2018 at 17:11 | comment | added | Greg Martin | Do you care if the $C_n$ is explicit, or is $\ll_n$ enough for your purposes? | |
| Apr 20, 2018 at 14:46 | comment | added | Daniel Loughran | @Asaf: Yes this was why it was not obvious to me how to generalise the proof to higher dimensions. | |
| Apr 20, 2018 at 14:32 | comment | added | Asaf | The proof is definitely specialized to $n=2$ case, as HB defines a basis for the lattice by choosing the shortest (lin. ind.) vectors, which is a special phenomenon taking place only in low dimensions. Note that the LLL algorithm will only give you a ''good'' basis but not necessarily the shortest vectors. | |
| Apr 20, 2018 at 13:49 | history | asked | Daniel Loughran | CC BY-SA 3.0 |