Delphi.science

Lower bounds for Naslund's crossing problem

Source: github.com/Arth-Singh/crossing-lower-bounds/tree/3d302668a9…

Arth Singh

Palomar Registrypalomar/PALOMAR-2026-11-16-000011Nov 16, 2026math.COscore 0

Lean 4 / Mathlib proofs of the first lower bounds above the trivial bound n for Naslund's crossing problem (J. Combin. Theory Ser. A 174 (2020), Problem 12). P(n) is the least r + s such that the tensor [x1 = x4][x2 = x3] on [n]^4 is a sum of r tensors of rank one along {12|34} and s tensors of rank one along {13|24}; in matrix form, the least rank B + rank R(C) over all splittings S_n = B + C of the swap matrix, where R is the realignment. Over every field the project proves P(n) ≥ 4n/3 for n ≥ 3, P(n) ≥ 15n/11 for n ≥ 5, P(n) ≥ 67n/49 for n ≥ 7, P(n) ≥ n + 3 for n ≥ 4, P(5) ≥ 8, P(6) ≥ 9,…

RepositoryJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-16-000011
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-16-000011/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-16-000011/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'