{"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","summary":"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,…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-16","reactions":{},"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"}]}