We construct a sequence of lattices $\{L_{n_i}\subset \mathbb R^{n_i}\}$ for $n_i\longrightarrow\infty$, with exponentially large kissing numbers, namely, $\log_2τ(L_{n_i})> 0.0338\cdot n_i -o(n_i)$. We also show that the maximum lattice kissing number $ τ^l_{n}$ in $n$ dimensions verifies $\log_2τ^l_{n}> 0.0219\cdot n -o(n)$.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。