Lean-verified proofs for [e13]
Lean-verified proofs for [e16]
Sergeev I. S. Upper bounds for the monotone rank of the unique disjointness matrix. arXiv ePrints. 2026. Art. 2607.27014.
- Upper bound for the partition rank of the unique disjointness matrix (Theorem 1).
LEAN
- Tight upper bound for the covering rank of the unique disjointness matrix (Theorem 2).
LEAN
Lean-verified proofs were derived by an AI-assistant from text proofs in Reaslab environment.
return to the main page