combinatorics / Discrete geometry - lattice paths

North-East Lattice Paths with Few Collinear Vertices

Both bounds move, and the gap stays enormous: the lower bound rises from exp⁡(Ω(log⁡2k))\exp(\Omega(\log^2 k)) to exp⁡(Ω(k1/3))\exp(\Omega(k^{1/3})) and the upper falls from exp⁡(O(k4))\exp(O(k^4)) to exp⁡(O(k2))\exp(O(k^2)), so A(k)A(k) is still undetermined between an exponent of k1/3k^{1/3} and one of k2k^2. The paper's own closing discussion argues its lower-bound construction is near the limit of the method and that beating it needs additional randomness, a sharper line-counting step, or a different model entirely.

15Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

combinatoricsJul 2, 2026Significance 15/100Registry: unreviewed

North-East Lattice Paths with Few Collinear Vertices

Prior state unknown→proved

Both bounds move, and the gap stays enormous: the lower bound rises from exp⁡(Ω(log⁡2k))\exp(\Omega(\log^2 k)) to exp⁡(Ω(k1/3))\exp(\Omega(k^{1/3})) and the upper falls from exp⁡(O(k4))\exp(O(k^4)) to exp⁡(O(k2))\exp(O(k^2)), so A(k)A(k) is still undetermined between an exponent of k1/3k^{1/3} and one of k2k^2. The paper's own closing discussion argues its lower-bound construction is near the limit of the method and that beating it needs additional randomness,…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Both bounds move, and the gap stays enormous: the lower bound rises from exp⁡(Ω(log⁡2k))\exp(\Omega(\log^2 k)) to exp⁡(Ω(k1/3))\exp(\Omega(k^{1/3})) and the upper falls from exp⁡(O(k4))\exp(O(k^4)) to exp⁡(O(k2))\exp(O(k^2)), so A(k)A(k) is still undetermined between an exponent of k1/3k^{1/3} and one of k2k^2. The paper's own closing discussion argues its lower-bound construction is near the limit of the method and that beating it needs additional randomness, a sharper line-counting step, or a different model entirely.

Both bounds move, and the gap stays enormous: the lower bound rises from exp⁡(Ω(log⁡2k))\exp(\Omega(\log^2 k)) to exp⁡(Ω(k1/3))\exp(\Omega(k^{1/3})) and the upper falls from exp⁡(O(k4))\exp(O(k^4)) to exp⁡(O(k2))\exp(O(k^2)), so A(k)A(k) is still undetermined between an exponent of k1/3k^{1/3} and one of k2k^2. The paper's own closing discussion argues its lower-bound construction is near the limit of the method and that beating it needs additional randomness, a sharper line-counting step, or a different model entirely.

Recorded attempts

Evidence graph

Connected research record

North-East Lattice Paths with Few Collinear Vertices — Mathematical Frontier Network