Quartic exponential matching in the unit square
Source: hexagonmath.org/abs/2611.00270v1
Take two independent samples of $n$ uniform points in the unit square. We prove that, with probability at least one half, the points can be paired so that the average of the exponential of the fourth power of the normalized pair distance is at most two. The distance normalization is $L\sqrt{\log n/n}$, with $L$ an absolute constant. One pairing therefore satisfies both coordinate inequalities in the symmetric $(4,4)$ case of Talagrand's matching problem. The argument first controls a vector field transporting smoothed point densities, and then converts that control to a pairing. The main…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00270
curl -X POST /api/v1/records/hexagon/2611.00270/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00270/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'