On the complexity of solving generic overdetermined bilinear systems (Q6163795)

This paper focusses on the complexity of the problem of solving bilinear algebraic systems over a field. Although the paper is present over a finite field, the authors claim that the main results are valid over any field. The analyzed bilinear systems are systems of \(m\) bilinear polynomials in \(n\) variables, over a finite field, where \(n\leq m\). Based on the observation that the solutions can be found in the \(\mathbb{F}[\mathbf{y}]\)-module generated by the system (\(\mathbb{F}\) is the field and \(\mathbf{y}\) one of the tuples variables) a conjecture on the regularity of the system and its generic properties is stated. Additionally, experimental comparisons are presented.