Polynomial growth conjecture for component ideal degrees of matrix rigidity varieties

From papers

Fix 0<ϵ<10<\epsilon<1 and 0<δ<10<\delta<1. Set r=ϵnr=\epsilon n and s=n1+δs=n^{1+\delta}. The notation R^[n,r,s]\hat{\mathcal R}[n,r,s] denotes the relevant matrix rigidity variety, and its irreducible components have ideals whose minimal polynomial degrees are being considered. Polynomial growth conjecture. The minimal degree of a polynomial in the ideal of each irreducible component of R^[n,r,s]\hat{\mathcal R}[n,r,s] grows like a polynomial in nn. This predicts that, despite the increasing complexity of the associated cones, the defining equations of every irreducible component admit polynomially bounded degree. The source gives no resolution of this conjecture.

Progress summary

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

Sources & referencesView supporting material

Primary source

Fulvio Gesmundo, Jonathan Hauenstein, Christian Ikenmeyer and JM Landsberg, “Complexity of linear circuits and geometry”, arXiv:1310.1362 (2015).

Solutions 0

No solutions have been posted yet.