arXiv (All)
open access
Maximal Minimal Spacing for Random Points
From $N+1$ random points on a line we wish to select $M+1$ points so as to maximize the minimal spacing between them. We consider an initial configuration with independent and identically distributed spacings. Equivalently, the points are arrival times of a generic renewal process. For general spaci
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
- Discrete Poincaré inequalities and universal approximators for random graphs#617836
- Discrete Poincaré inequalities and universal approximators for random graphs#617336
- Longest increasing subsequences of dyadic-type chaotic orbits#996935
- Point process convergence of large inradii of Poisson-Laguerre tessellations#1034546
- Distances in $m$-ary recursive trees#1118709
Record · ID 926067
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