arXiv (All)
open access
Lattices with Large Kissing Number from Local Density
Let $κ_p(n)$ denote the maximum kissing number of a lattice $\mathcal{L} \subset \mathbb{R}^n$. We prove that $κ_p(n) \geq 2^{Ω(\sqrt{n})}$ for all $p\ge 1$ and that $κ_p(n) \geq Ω(α_p^n)$ for all $p > 2$, where $α_p > 1$ is a constant depending only on $p$. In particular, our former result improves
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On the largest independent sets in the Kneser graph on chambers of PG(4,q)#350962
- Percolation on interdependent one-dimensional long-range networks#1234464
- Sudakov minoration for unconditional log-concave vectors with negatively associated magnitudes#1104724
- $α$-monogeneity of pure number fields: criterion and density#670408
- $α$-monogeneity of pure number fields: criterion and density#668343
Record · ID 1325276
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive