A simple proof of a reverse Minkowski theorem for integral lattices

arXiv (Cornell University)(2023)

引用 0|浏览4
暂无评分
摘要
We prove that for any integral lattice $\mathcal{L} \subset \mathbb{R}^n$ (that is, a lattice $\mathcal{L}$ such that the inner product $\langle \mathbf{y}_1,\mathbf{y}_2 \rangle$ is an integer for all $\mathbf{y}_1, \mathbf{y}_2 \in \mathcal{L}$) and any positive integer $k$, \[ |\{ \mathbf{y} \in \mathcal{L} \ : \ \|\mathbf{y}\|^2 = k\}| \leq 2 \binom{n+2k-2}{2k-1} \; , \] giving a nearly tight reverse Minkowski theorem for integral lattices.
更多
查看译文
关键词
reverse minkowski theorem,simple proof
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要