Independent Verification of the Wang F₂-Certificate for R(⟨3,3,3⟩) ≥ 20

Independent replay-verification of Wang's finite-field lower-bound certificatefor 3×3 matrix multiplication rank over F₂. Main result: The Wang F₂-certificate (arXiv:2603.07280, 2026) forR_F₂(⟨3,3,3⟩) ≥ 20 has been fully and independently replay-verified.All 496 entries passed without failure. Runtime: ~3.3 hours. Proof mix:- flatten_matrix: 14 entries- forced_product: 14 entries- backtracking: 238 entries- degenerate: 230 entries Claim scope (guarded):- claim_type: finite_field_lower_bound_certificate- claim: R_F₂(⟨3,3,3⟩) ≥ 20 (F₂-specific only)- anti_claim: not_global_rank_lower_bound This verification does NOT imply:- integer or characteristic-free rank bounds over ℤ/ℚ/ℂ- R(⟨3,3,3⟩) = 22 or = 23- rank-22 exclusion over ℚ or ℂ Background: Bläser proved R(⟨3,3,3⟩) ≥ 20 over arbitrary fieldsby algebraic methods. Wang (arXiv:2603.07280) provides an independent,automated, machine-verifiable F₂-specific certificate with 496 entries.Both results are independent and complementary.R(⟨3,3,3⟩) remains open: 19 ≤ R ≤ 23 (Bläser / Laderman 1976). Stefan Beuchert (ORCID: 0009-0002-3883-5540) Mail:: [email protected] Reference: Wang, arXiv:2603.07280 (2026)License: Creative Commons Attribution 4.0 International

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-06-18
DOI
https://doi.org/10.5281/zenodo.20691957
Primary Topic
Polynomial and algebraic computation
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Independent Verification of the Wang F₂-Certificate for R(⟨3,3,3⟩) ≥ 20

Stefan Beuchert
Zenodo (CERN European Organization for Nuclear Research)
Polynomial and algebraic computation
preprint

Independent Verification of the Wang F₂-Certificate for R(⟨3,3,3⟩) ≥ 20

Stefan Beuchert
preprint en

Abstract

Independent replay-verification of Wang's finite-field lower-bound certificatefor 3×3 matrix multiplication rank over F₂. Main result: The Wang F₂-certificate (arXiv:2603.07280, 2026) forR_F₂(⟨3,3,3⟩) ≥ 20 has been fully and independently replay-verified.All 496 entries passed without failure. Runtime: ~3.3 hours. Proof mix:- flatten_matrix: 14 entries- forced_product: 14 entries- backtracking: 238 entries- degenerate: 230 entries Claim scope (guarded):- claim_type: finite_field_lower_bound_certificate- claim: R_F₂(⟨3,3,3⟩) ≥ 20 (F₂-specific only)- anti_claim: not_global_rank_lower_bound This verification does NOT imply:- integer or characteristic-free rank bounds over ℤ/ℚ/ℂ- R(⟨3,3,3⟩) = 22 or = 23- rank-22 exclusion over ℚ or ℂ Background: Bläser proved R(⟨3,3,3⟩) ≥ 20 over arbitrary fieldsby algebraic methods. Wang (arXiv:2603.07280) provides an independent,automated, machine-verifiable F₂-specific certificate with 496 entries.Both results are independent and complementary.R(⟨3,3,3⟩) remains open: 19 ≤ R ≤ 23 (Bläser / Laderman 1976). Stefan Beuchert (ORCID: 0009-0002-3883-5540) Mail:: [email protected] Reference: Wang, arXiv:2603.07280 (2026)License: Creative Commons Attribution 4.0 International

Zenodo (CERN European Organization for Nuclear Research)
Reduced inequalities
Polynomial and algebraic computation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.