☰
All Packages
Criteria
All Packages
Criteria
Readme
Versions (1)
Dependencies (9)
l2Lean
0.1.0
Two-fold Langford sequences exist exactly when 3l >= 2d - 1: a Lean 4 proof, with the m-fold counting bound attained for every m
#mathematics
#combinatorics
#palomar
Displaying
1-1
of
1
versions of
l2Lean
Sort by
Date
0.1
Version track: 0.1
0.1.0
6 days ago
Released on September 27, 2026 at 4:52:12PM
Build data not currently included on Reservoir.
See the package repository's CI instead.
v4.35.0-rc2
1
20