Abstract
The solving degree of a system of multivariate polynomial equations provides an upper bound for the complexity of computing the solutions of the system via Gröbner basis methods. In this paper, we consider polynomial systems that are obtained via Weil restriction of scalars. The latter is an arithmetic construction which, given a finite Galois field extension k↪K, associates to a system F defined over K a system Weil(F) defined over k, in such a way that the solutions of F over K and those of Weil(F) over k are in natural bijection. In this paper, we find upper bounds for the complexity of solving a polynomial system Weil(F) obtained via Weil restriction in terms of algebraic invariants of the system F.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
