Bernstein-Gelfand-Gelfand meets geometric complexity theory: resolving the 2 x 2 permanents of a 2 x n matrix
Abstract
We describe the minimal free resolution of the ideal of 2 × 2 subpermanents of a 2 × n generic matrix M. In contrast to the case of 2 × 2 determinants, the 2 × 2 permanents define an ideal which is neither prime nor Cohen-Macaulay. We combine work of Laubenbacher-Swanson on the Gr\"obner basis of an ideal of 2 × 2 permanents of a generic matrix with our previous work connecting the initial ideal of 2 × 2 permanents to a simplicial complex. The main technical tool is a spectral sequence arising from the Bernstein-Gelfand-Gelfand correspondence.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.