An upper bound for the solving degree in terms of the degree of regularity

Abstract

The solving degree is an important parameter for estimating the complexity of solving a system of polynomial equations.
In this paper, we provide an upper bound for the solving degree in terms of the degree of regularity. We also show that this bound is optimal. As a direct consequence, we prove an upper bound for the last fall degree and a Macaulay bound.

Accessibility Summary:

In accordance with Title II regulations this content meets all points of exemption as Archived web content and/or Preexisting conventional electronic documents.