Chengu Wang

collaborators

4 papers

cs.CC2026

A Lower Bound of 21 for $3 \times 3$ Matrix Multiplication over $F_{2}$

Chengu Wang

We prove that $3 \times 3$ matrix multiplication over $F_{2}$ has bilinear complexity at least $21$ , improving the previous lower bound of $20$ . Lower bounds for restrictions…

math.MG2026

Optimal Extensions of Cross-Sections: Sphere Packings in Dimensions 38 to 43

Ivan Dorofeev, Xiaoming Sun, Chengu Wang

We improve the best known sphere packings in every dimension from $38$ to $43$ . Our packings in dimensions $38$ to $42$ come from one chain of cross-sections of the extremal even u…

cs.CC2026

Automated Lower Bounds for Bilinear Complexity over Finite Fields

Chengu Wang

We present a general, automated framework for proving lower bounds on the bilinear complexity (tensor rank) of multiplication problems over a finite field $F_{q}$ . The frame…

cs.DS2025

Depth-13 Sorting Networks for 28 Channels

Chengu Wang

We establish new depth upper bounds for sorting networks on 27 and 28 channels, improving the previous best bound of 14 to 13. Our 28-channel network is constructed with reflection…

A Lower Bound of 21 for 3×3 Matrix Multiplication over F2​

Optimal Extensions of Cross-Sections: Sphere Packings in Dimensions 38 to 43

Automated Lower Bounds for Bilinear Complexity over Finite Fields

Depth-13 Sorting Networks for 28 Channels

A Lower Bound of 21 for $3 \times 3$ Matrix Multiplication over $F_{2}$