Timeline for The smallest volume possible for a lattice with integer distances?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 20, 2022 at 8:36 | comment | added | Aurel | @BenMares The way I understood the question, the OP wanted an order of magnitude. But I agree that the question of the exact bound is not solved for all $n$. | |
| Apr 20, 2022 at 8:00 | comment | added | Ben Mares | What about an upper bound? If $n$ is not divisible by 8, then $D_n$ is above the lower bound by a factor of $2$. When $n$ is 1 mod 8, then $kE_8\oplus A_2$ is above by a factor of $\sqrt{3}$. Can this be improved? | |
| Apr 20, 2022 at 0:22 | comment | added | Yoav Kallus | And this bound is achieved whenever n is divisible by 8. See: en.wikipedia.org/wiki/Unimodular_lattice | |
| Apr 19, 2022 at 21:54 | vote | accept | Eric Naslund | ||
| Apr 19, 2022 at 21:53 | history | answered | Aurel | CC BY-SA 4.0 |