Polynomial codegrees and dual defects of general determinantal loci

Let Dn2ms,nD^{s,n}_{n^2-m} denote the determinantal locus of general n×nn\times n matrices of the indicated rank parameter. For any fixed m>0m>0, the general determinantal-locus conjecture.

the dual defect of Dn2ms,n is max(0,s2m), independently of n,and the codegree of Dn2ms,n depends polynomially on n.\begin{aligned} &\text{the dual defect of }D^{s,n}_{n^2-m}\text{ is }\max(0,s^2-m),\text{ independently of }n,\\ &\text{and the codegree of }D^{s,n}_{n^2-m}\text{ depends polynomially on }n. \end{aligned}

The conjecture extends the known case m=1m=1, where the dual defect is s21s^2-1 and the codegree is given by a polynomial expression in nn. It predicts uniform behavior for defective general determinantal loci with fixed mm; the source gives no resolution.

Sources & referencesView supporting material

Primary source

Laurent Manivel, Mateusz Michałek, Leonid Monin, Tim Seynnaeve and Martin Vodička, “Complete quadrics: Schubert calculus for Gaussian models and semidefinite programming”, arXiv:2011.08791 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.