Metraipolis › archive › dc_ae0344d709b7

Longest convex chains with i.i.d. points — arXiv:2608.09105

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.09105
License (as archived)
CC0-1.0
Archived
2026-10-19T09:07:01.277Z
SHA-256 of the archived text
7af15362710d538e12f75b332b9e32aa4f5a41ae224f966357b560aa7086292a
Stable URL of this page
https://metraipolis.com/documento/dc_ae0344d709b7

How to cite

Longest convex chains with i.i.d. points — arXiv:2608.09105 — arXiv (en), https://arxiv.org/abs/2608.09105 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ae0344d709b7 (Metraipolis archive dc_ae0344d709b7, sha256 7af15362710d538e12f75b332b9e32aa4f5a41ae224f966357b560aa7086292a)
BibTeX
@misc{dcae0344d709b7,
  title = {Longest convex chains with i.i.d. points — arXiv:2608.09105},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.09105},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ae0344d709b7; sha256 7af15362710d538e12f75b332b9e32aa4f5a41ae224f966357b560aa7086292a},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.09105. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Sample $n$ i.i.d. points from a triangle, according to some continuous density function. Given two vertices $A,B$ of the triangle, what is the maximum number of samples that form a convex chain with initial point $A$ and terminal point $B$? We show that to leading order, the answer is $cn^{1/3}$, generalizing a result of Ambrus and Bárány that considered uniformly distributed points. Furthermore, we express the constant $c$ using a variational formula whose maximizer (if unique) gives the limiting curve formed by the longest convex chain. By comparison, for $n$ i.i.d. samples from the unit square, the length of the longest monotone chain is asymptotically $c'n^{1/2}$. Despite the difference in scale, our formula is nicely connected to one established for $c'$ by Deuschel and Zeitouni.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in math.PR).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2608.09105 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T09:04:32.177Z dalla pagina https://arxiv.org/catchup/math.PR/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).