On the Complexity of Computing Gröbner Bases for Quasi-homogeneous Systems

Jean-Charles Faugère 1 Mohab Safey El Din 1 Thibaut Verron 1
1 PolSys - Polynomial Systems
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
Abstract : Let $\K$ be a field and $(f_1, \ldots, f_n)\subset \K[X_1, \ldots, X_n]$ be a sequence of quasi-homogeneous polynomials of respective weighted degrees $(d_1, \ldots, d_n)$ w.r.t a system of weights $(w_{1},\dots,w_{n})$. Such systems are likely to arise from a lot of applications, including physics or cryptography. We design strategies for computing Gröbner bases for quasi-homogeneous systems by adapting existing algorithms for homogeneous systems to the quasi-homogeneous case. Overall, under genericity assumptions, we show that for a generic zero-dimensional quasi-homogeneous system, the complexity of the full strategy is polynomial in the weighted Bézout bound $\prod_{i=1}^{n}d_{i} / \prod_{i=1}^{n}w_{i}$. We provide some experimental results based on generic systems as well as systems arising from a cryptography problem. They show that taking advantage of the quasi-homogeneous structure of the systems allow us to solve systems that were out of reach otherwise.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [21 references]  Display  Hide  Download

Contributor : Thibaut Verron <>
Submitted on : Friday, May 3, 2013 - 12:27:03 PM
Last modification on : Thursday, March 21, 2019 - 12:58:55 PM
Document(s) archivé(s) le : Sunday, August 4, 2013 - 4:04:37 AM


Files produced by the author(s)



Jean-Charles Faugère, Mohab Safey El Din, Thibaut Verron. On the Complexity of Computing Gröbner Bases for Quasi-homogeneous Systems. The 38th International Symposium on Symbolic and Algebraic Computation, Jun 2013, Boston, Maine, United States. pp.189-196, ⟨10.1145/2465506.2465943⟩. ⟨hal-00780388v2⟩



Record views


Files downloads