Lattices with exponentially large kissing numbers

@inproceedings{Vluaduct2018LatticesWE,
  title={Lattices with exponentially large kissing numbers},
  author={Serge Vluaduct},
  year={2018}
}
We construct a sequence of lattices {Lni ⊂ Rni} for ni −→ ∞, with exponentially large kissing numbers, namely, log2 τ(Lni) > 0.0338 · ni − o(ni). We also show that the maximum lattice kissing number τ l n in n dimensions verifies log2 τ l n > 0.0219 · n− o(n). AMS 2010 Classification: 11H31, 11H71, 14G15, 52C17; 
4 Citations
On kissing numbers and spherical codes in high dimensions
  • 19
  • PDF
(Gap/S)ETH hardness of SVP
  • 24
  • PDF
Approximation and Hardness: Beyond P and NP
  • 3
  • PDF
On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
  • 16
  • PDF

References

SHOWING 1-10 OF 21 REFERENCES
...
1
2
3
...