Recursive elimination-equation conjecture for three forms

Let ff and gg be the forms in the construction preceding the claim, and define

h1=det(f,g)(s,t),hi+1=det(f,hi)(s,t).h_1=\det(f,g)_{(s,t)},\qquad h_{i+1}=\det(f,h_i)_{(s,t)}.

Let L=(f,g,h1,,hn)L=(f,g,h_1,\ldots,h_n).

Recursive elimination conjecture. For arbitrary nn,

L=(f,g,h1,,hn).L=(f,g,h_1,\ldots,h_n).

The source reports computational verification in degrees 55 and 66 and conjectures the displayed description for arbitrary nn; its general status is unresolved in the source.

Sources & referencesView supporting material

Primary source

Wolmer V. Vasconcelos, “Complexity Degrees of Algebraic Structures”, arXiv:1402.1906 (2014).

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.