Lower bounds for the Beardwood–Halton–Hammersley constant
Source: hexagonmath.org/abs/2611.00381v1
Let $\beta$ be the Beardwood–Halton–Hammersley constant: the shortest tour through $n$ independent uniform random points in the unit square has length asymptotic to $\beta\sqrt n$ almost surely. Dong and Cao proved $\beta\ge0.6421$ from an inequality $\beta\ge5/8+\sum_{k=3}^{K}C_k$, where $C_k$ is an integral over configurations of $k$ points in the plane that form a connected graph when points at distance at most $1$ are joined. For $C_3$, $C_4$ and $C_5$, sharper bounds come from a first-order expansion of the area of the union of the unit disks on boxes of configurations. For…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00381
curl -X POST /api/v1/records/hexagon/2611.00381/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00381/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'