arXiv (All)
open access
Asymptotics of Random-Lattice Enumeration: Beyond HKZ via Dense Sublattices
To bridge the gap between worst-case and heuristic analyses of lattice enumeration, we study the sizes of (unpruned) enumeration trees on $n$-dimensional Haar-random lattices. Writing $n^{cn+o(n)}$ for the tree size at the shortest vector radius, we investigate the asymptotic scaling of $c$, and whi
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 (n,k)-Simple Random Integer Lattices.#315711
- Descriptive complexity results related to uniform distribution theory (Analytic Number Theory and Related Topics)#378247
- Descriptive complexity results related to uniform distribution theory (Analytic Number Theory and Related Topics)#378240
- Large deviations for random sums and random convex polygons#326181
- The Erdős-Falconer distance problem in the integer lattice#1247592
Record · ID 1326515
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