Gowers–Long: F(n) ≥ n^{3/2} when n is a perfect square
Source: github.com/VictorLiwentao/fc-palomar-proofs/tree/9b2a1eeaa6…
Let F(n) be the maximal length of a 2-increasing sequence of triples in {1..n}^3, where a triple is 2-less than another if it is smaller in at least two coordinates. Gowers and Long show that F(n) ≥ n^{3/2} when n is a perfect square (arXiv:1609.08688, Proposition 1.4). The package proves (√n)^3 ≤ F(n) for every perfect square n.
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-13-000015
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-13-000015/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-13-000015/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'