← All papers
First page of Positivity in symmetric webs and block permanents

Positivity in symmetric webs and block permanents

Daniel Tubbenhauer

math.CO Nov 17, 2026 · v1 math.RT
The paper's results are formalized in Lean, with the cited literature taken as input axioms, and the formalization is available in a linked repository.
We use symmetric webs to prove Marcus's block-permanent inequality for up to four blocks of every size, for five blocks of size at least three, and for any fixed number of blocks above an explicit logarithmic bound on the block size. The proof idea is easy: Bending strands in the Schur relation turns the comparison into a calculation with squared norms.

Marcus conjectured in the 1960s that for a positive semidefinite block matrix A with m blocks of size k, per A is at least the permanent of the Gram matrix G of block permanents. The conjecture is open in general.

Symmetric webs, which are diagrams for linear maps on symmetric powers, are used to express the permanent difference. Strands are bent in the Schur relation so that the comparison becomes a calculation with sums of squared norms. Separate cut arguments cover three, four and five blocks and many disjoint packet pairs. A Lean formalization of the paper, with the cited literature taken as axioms, is provided.

The inequality holds for m ≤ 4 and every block size k, for m = 5 with k ≥ 3, and for any m whenever 2^k − 1 ≥ m(m−1)(2m−1)/(6⌊m/2⌋). In particular, k ≥ 2 log₂ m suffices.