A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit <a rel="external noopener" href="https://hal.inria.fr/hal-01097316/document">the original URL</a>. The file type is <code>application/pdf</code>.
<i title="Elsevier BV">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ezljl2d3lzga5efenbxdvvfcpa" style="color: black;">Journal of symbolic computation</a>
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,...,w_n), W-homogeneous polynomials are polynomials which are homogeneous w.r.t the weighted degree _W(X_1^α_1,...,X_n^α_n) = ∑ w_iα_i. Gröbner bases for weighted homogeneous systems can be computed by adapting existing algorithms for homogeneous systems to the weighted<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jsc.2015.12.001">doi:10.1016/j.jsc.2015.12.001</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5xnhv5awu5dttgraorrc7dvo7m">fatcat:5xnhv5awu5dttgraorrc7dvo7m</a> </span>
more »... geneous case. We show that in this case, the complexity estimate for Algorithm 5 (n+-1^ω) can be divided by a factor (∏ w_i)^ω. For zero-dimensional systems, the complexity of Algorithm nD^ω (where D is the number of solutions of the system) can be divided by the same factor (∏ w_i)^ω. Under genericity assumptions, for zero-dimensional weighted homogeneous systems of W-degree (d_1,...,d_n), these complexity estimates are polynomial in the weighted Bézout bound ∏_i=1^nd_i / ∏_i=1^nw_i. Furthermore, the maximum degree reached in a run of Algorithm 5 is bounded by the weighted Macaulay bound ∑ (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.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922144649/https://hal.inria.fr/hal-01097316/document" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f1/a7/f1a7bde5b6c4836f312354355e2969a2b6243cdf.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jsc.2015.12.001"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>