no. 17 · Wednesday 18 November 2026
Positivity in symmetric webs and block permanents
Abstract
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.
- comments
- 31 pages, many figures, Lean verification available, comments welcome
- fields
- Combinatorics, Representation Theory