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 Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-13 Formalized: true Formalizes: title=The length of an s-increasing sequence of r-tuples identifier=arXiv:1609.08688 relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-13-000015 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.