Id: palomar/PALOMAR-2026-11-16-000011 Url: https://github.com/Arth-Singh/crossing-lower-bounds/tree/3d302668a9f3928021ea33a8ef53ca2ad63d37c7 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-16-000011-v1.json Repo: https://github.com/Arth-Singh/crossing-lower-bounds Tags: math.CO, cs.CC, msc:15A69, msc:15A03, msc:68Q17, msc:68V20 Score: 0 Title: Lower bounds for Naslund's crossing problem Trust: high Domain: math.CO Source: palomar Authors: Arth Singh Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-16 Formalized: true Formalizes: title=Lower bounds for Naslund's crossing problem identifier=https://github.com/Arth-Singh/crossing-lower-bounds/tree/main/paper relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-16-000011 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,…