arXiv (All)
open access
On Lattice Diameter Segments: Algorithms and Structure
The lattice diameter of a bounded set $S \subset \mathbb{R}^d$ counts the maximal number of lattice points in a segment whose endpoints are lattice points in $S$. Such a segment is called a lattice diameter segment of $S$. This basic invariant in the geometry of numbers has several interesting appli
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
- Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams#793655
- Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams#789651
- Arranging circles of radii 1,2,...,n around a central circle: a Supnick TSP and certified finite optima#1123180
- Sharp comparison between the perimeter and its fractional analogue in two dimensions#1160769
- Normal and Lognormal Asymptotics for Lattice-Point Counts in Random Translates of High-Dimensional Balls#818856
Record · ID 1199692
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