On the complexity of computing Gröbner bases for weighted homogeneous systems

DOI10.1016/J.JSC.2015.12.001MaRDI QIDQ5963397zbMATH OpenOpenAlexFDO

Authors Jean-Charles Faugère, Mohab Safey El Din, Thibaut Verron

Publication date 19 February 2016

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1412.7547

polynomial system solving quasi-homogeneous systems Gröbner bases weighted homogeneous systems

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Abstract: Solving polynomial systems arising from applications is frequently made easier by the structure of the systems. Weighted homogeneity (or quasi-homogeneity) is one example of such a structure: given a system of weights

W = (w_{1}, d o t s, w_{n})

,

W

-homogeneous polynomials are polynomials which are homogeneous w.r.t the weighted degree

d e g_{W} (X_{1}^{a l p h a_{1}}, d o t s, X_{n}^{a l p h a_{n}}) = s u m w_{i} a l p h a_{i}

. Gr"obner bases for weighted homogeneous systems can be computed by adapting existing algorithms for homogeneous systems to the weighted homogeneous case. We show that in this case, the complexity estimate for Algorithm~F5

can be divided by a factor

l e f t (p r o d w_{i} i g h t)^{o m e g a}

. For zero-dimensional systems, the complexity of Algorithm~FGLM

n D^{o m e g a}

(where

D

is the number of solutions of the system) can be divided by the same factor

l e f t (p r o d w_{i} i g h t)^{o m e g a}

. Under genericity assumptions, for zero-dimensional weighted homogeneous systems of

W

-degree

(d_{1}, d o t s, d_{n})

, these complexity estimates are polynomial in the weighted B'ezout bound

p r o d_{i = 1}^{n} d_{i} / p r o d_{i = 1}^{n} w_{i}

. Furthermore, the maximum degree reached in a run of Algorithm F5 is bounded by the weighted Macaulay bound

s u m (d_{i} - w_{i}) + w_{n}

, and this bound is sharp if we can order the weights so that

w_{n} = 1

. For overdetermined semi-regular systems, estimates from the homogeneous case can be adapted to the weighted case. We provide some experimental results based on systems arising from a cryptography problem and from polynomial inversion problems. They show that taking advantage of the weighted homogeneous structure yields substantial speed-ups, and allows us to solve systems which were otherwise out of reach.

Recommendations

Cites work

Cited in

(6)

Describes a project that uses

Uses Software

This page was built for publication: On the complexity of computing Gröbner bases for weighted homogeneous systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963397)