{"id":"palomar/PALOMAR-2026-11-13-000015","url":"https://github.com/VictorLiwentao/fc-palomar-proofs/tree/9b2a1eeaa6d00172a8e08351ed43b896e21ce950","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-13-000015-v1.json","repo":"https://github.com/VictorLiwentao/fc-palomar-proofs","tags":["math.CO","msc:05D05","msc:06A07"],"score":0,"title":"Gowers–Long: F(n) ≥ n^{3/2} when n is a perfect square","trust":"high","domain":"math.CO","source":"palomar","authors":["Wentao Li"],"reviews":0,"subject":"math.CO","summary":"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.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-13","reactions":{},"formalized":true,"formalizes":[{"title":"The length of an s-increasing sequence of r-tuples","identifier":"arXiv:1609.08688","relationship":"formalizes"}]}