On the complexity of Gröbner basis computation of semi-regular overdetermined algebraic equations

Abstract

We extend the notion of regular sequence ([Mac16]) to overdetermined system of algebraic equations. We study generic properties of Grobner bases and analyse precisely the behavior of the F5 [Fau02] algorithm. Sharp asymptotic estimates of the degree of regularity are given.