Fano Schemes of Determinants and Permanents
summary
Gives a precise criterion for when the Fano scheme F_k(D_n) of k-planes in the determinant hypersurface is connected: components come from compression space components and connectivity reduces to which torus-fixed points lie in which compression spaces, proved by torus action and tangent-space/deformation calculations. Key exact facts: F1(D_n) has exactly n irreducible components each of dimension 2n^2 − n − 1; maximal linear spaces have dimension n(n−1). Partial analogues for the permanent show many more components (e.g. 21 vs 3) and yield a product-rank lower bound per_3 = 4.
AI-written summary · about
chapters (13)
- 0:00Introduction
- 0:28Singular matrix spaces
- 1:23Compression spaces
- 3:54Complexity theory context
- 5:48Fano schemes defined
- 7:24Planes of 2x2 matrices
- 9:30Geometry of Fano schemes
- 12:44Higher dimensional spaces
- 15:27Connectedness results
- 19:37Proof sketch
- 24:05Proving disconnectedness
- 27:28Permanents vs determinants
- 32:35Applications and open problems
